Counting primes in the interval (n^2,(n+1)^2)

Details Counting primes in the interval (n^2,(n+1)^2) Counting primes in the interval (n^2,(n+1)^2)

2006-07-04

arxiv.org/abs/math/0607096v1

Mathematics

Number Theory

This is a three pages unsuccessful (but maybe useful) challenge, for proving the old-famous conjecture, which asserts for ever

Scientific paper

In this note, we show that there are many infinity positive integer values of
$n$ in which, the following inequality holds $$
\left\lfloor{1/2}(\frac{(n+1)^2}{\log(n+1)}-\frac{n^2}{\log n})-\frac{\log^2
n}{\log\log n}\right\rfloor\leq\pi\big((n+1)^2\big)-\pi(n^2). $$

Affiliated with

Also associated with

No associations

Rating

Counting primes in the interval (n^2,(n+1)^2) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting primes in the interval (n^2,(n+1)^2), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting primes in the interval (n^2,(n+1)^2) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-240150