Towards Proving Legendre's Conjecture

Details Towards Proving Legendre's Conjecture Towards Proving Legendre's Conjecture

2008-11-26

arxiv.org/abs/0811.4451v2

Mathematics

Number Theory

Scientific paper

Legendre's conjecture states that there is a prime number between n^2 and (n+1)^2 for every positive integer n. We consider the following question : for all integer n>1 and a fixed integer k<=n does there exist a prime number such that kn < p < (k+1)n ? Bertrand-Chebyshev theorem answers this question affirmatively for k=1. A positive answer for k=n would prove Legendre's conjecture. In this paper, we show that one can determine explicitly a number N(k) such that for all n >= N(k), there is at least one prime between kn and (k+1)n. Our proof is based on Erdos's proof of Bertrand-Chebyshev theorem and uses elementary combinatorial techniques without appealing to the prime number theorem.

Affiliated with

Also associated with

No associations

Rating

Towards Proving Legendre's Conjecture 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 Towards Proving Legendre's Conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Towards Proving Legendre's Conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-231845