Re: Prime count question
- To: mathgroup at smc.vnet.net
- Subject: [mg126493] Re: Prime count question
- From: Murray Eisenberg <murray at math.umass.edu>
- Date: Mon, 14 May 2012 01:37:33 -0400 (EDT)
- Delivered-to: l-mathgroup@mail-archive0.wolfram.com
- References: <201205130702.DAA16830@smc.vnet.net>
- Reply-to: murray at math.umass.edu
Presumably you mean "less than or equal to x", since otherwise your pi(x) is always infinite. On 5/13/12 3:02 AM, J.Jack.J. wrote: > 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. > -- Murray Eisenberg murray at math.umass.edu Mathematics & Statistics Dept. Lederle Graduate Research Tower phone 413 549-1020 (H) University of Massachusetts 413 545-2859 (W) 710 North Pleasant Street fax 413 545-1801 Amherst, MA 01003-9305
- References:
- Prime count question
- From: "J.Jack.J." <jack.j.jepper@googlemail.com>
- Prime count question