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


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

Re: Prime count question

From Bob Hanlon <hanlonr357@gmail.com>
Newsgroups comp.soft-sys.math.mathematica
Subject Re: Prime count question
Date 2012-05-14 05:38 +0000
Organization Steven M. Christensen and Associates, Inc and MathTensor, Inc.
Message-ID <joq5ot$r52$1@smc.vnet.net> (permalink)
References <201205130702.DAA16830@smc.vnet.net>

Show all headers | View raw


Since the number of primes greater than or equal to any real number is infinite, I assume that you mean less than or equal to. In that case use, use the built-in function PrimePi.

Your parentheses are unbalanced so the following may not be your intended equation. And once again you have failed to use proper Mathematica syntax in posing your question.

Maximize returns a local maxima in this case so I applied brute force.

t[x_] = PrimePi[x]/((x Log[x] (1 + 2.51/(Log[x]^2))));

ymin = 599; tax = 355991;

data = ({#, t[#]}& /@ Range[ymin, ymax];

dataMax = Max[data[[All, 2]]];

Select[data, #[[2]] == dataMax&]

{{59797, 1.00019}}

t[59797]

1.00019


Bob Hanlon


On May 13, 2012, at 3:02 AM, "J.Jack.J." <jack.j.jepper@googlemail.com> 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.
>

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


Thread

Re: Prime count question Bob Hanlon <hanlonr357@gmail.com> - 2012-05-14 05:38 +0000

csiph-web