Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]


Groups > comp.soft-sys.math.mathematica > #10057

Prime count question

From "J.Jack.J." <jack.j.jepper@googlemail.com>
Newsgroups comp.soft-sys.math.mathematica
Subject Prime count question
Date 2012-05-13 07:04 +0000
Organization Steven M. Christensen and Associates, Inc and MathTensor, Inc.
Message-ID <jonmd4$gf9$1@smc.vnet.net> (permalink)

Show all headers | View raw


Let pi(x) be the number of primes greater than or equal to x.

Then how do I find, through Mathematica, x such that

t(x) = pi(x) / ((x/ln(x))*(1+1/ln(x) + 2.51/(ln^2(x))))

is the highest t(y) such that  599 <= y <= 355991?

Many thanks in advance -- thanks also to those who helped with my
previous question.

Back to comp.soft-sys.math.mathematica | Previous | Next | Find similar | Unroll thread


Thread

Prime count question "J.Jack.J." <jack.j.jepper@googlemail.com> - 2012-05-13 07:04 +0000

csiph-web