Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.soft-sys.math.mathematica > #10057 > unrolled thread
| Started by | "J.Jack.J." <jack.j.jepper@googlemail.com> |
|---|---|
| First post | 2012-05-13 07:04 +0000 |
| Last post | 2012-05-13 07:04 +0000 |
| Articles | 1 — 1 participant |
Back to article view | Back to comp.soft-sys.math.mathematica
Prime count question "J.Jack.J." <jack.j.jepper@googlemail.com> - 2012-05-13 07:04 +0000
| From | "J.Jack.J." <jack.j.jepper@googlemail.com> |
|---|---|
| Date | 2012-05-13 07:04 +0000 |
| Subject | Prime count question |
| Message-ID | <jonmd4$gf9$1@smc.vnet.net> |
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 top | Article view | comp.soft-sys.math.mathematica
csiph-web