Proof of Legendre’s Conjecture | Open Access Journals

Proof of Legendre’s Conjecture

Samuel Bonaya Buya*

Department of Mathematics/Physics at Ngao girls, Secondary School, Kenya

*Corresponding Author:
Samuel Bonaya Buya
Samuel BB, Mathematics/Physics teacher at Ngao girls
Secondary School, Kenya
Email: sbonayab@gmail.com

Received date: 16/01/2018; Accepted date: 18/01/2018; Published date: 18/01/2018

Visit for more related articles at Journal of Applied Science and Innovations

Abstract

A method is presented to prove Legendre’s conjecture based on identity that holds true for all numbers

Keywords

Legendre’s conjecture, Hypothesis

Introduction

The properties of prime numbers have been studied for many centuries. Euclid gave the first proof of infinity of primes. Euler gave a proof which connected primes to the zeta function. Then there was the Gauss and Legendre’s formulation of the prime number theorem and its proof by Hadamard and de la Vallee Poussin. Riemann further came with some hypothesis about the roots of the Riemann-zeta function [1,2].

Many others have contributed towards prime number theory.

Legendre’s conjecture, proposed by Adrien-Marie Legendre states that there is a prime number between n2 and (n+1)2 for every positive integer n. The conjecture is one of Landau’s problems (1912) on prime numbers. The conjecture has not been proved to the time of writing of this paper [3,4].

The Goldbach conjecture was proved in a paper entitled “a simple proof of Goldbach conjecture.

In this research a method will be presented of proving Legendre’s conjecture.

Methodology

From Legendre conjecture:

equation (1)

equation are composite numbers with exceptional case where n=1.

Consider a prime number:

equation (2)

Such that:

equation(3)

From 3:

equation

equation (4)

When one is added to a prime number the result is an even number (e).

e = n2 + r +1 (5)

According to Goldbach conjecture (proved) every even number greater than two is a sum of two prime numbers.

Therefore:

e ≥ 4 (6)

n =1 (7)

We consider the limit case n =1 and e ≥ 4 , then by equation 4, ( e ≥ 4 ).

For e ≥ 4

For odd primes p2 and p2 then interpreting equation 4 using Goldbach conjecture:

equation (8)

From equation 2:

equation(9)

equation

equation

Goldbach conjecture states that every prime number greater than two is the sum of two prime numbers. Equation 9 borders on Goldbach conjecture. For the purpose of the present analysis we will rewrite the equation to suit our proof method [5-8].

equation (10)

equation (11)

Existence of a prime number between equation also means existence of an even number twice the prime in the range ( 2n2 < 2 p ≤ 2n2 + 4n ). This implies in this range there should also be an even number that is twice a prime number. The effectively means if n is even r should be odd and versa [9,10].

Legendre’s conjecture implies the maximum gap between primes for numbers between equation is given by:

equation (12)

This means the minimum number of primes from 1 to is given by:

equation (13)

Thus between 1 and 4:

equation

Between 1 and 9:

equation

Between 1 and 100:

equation

For numbers between 1 and one million:

equation

This means the minimum number of primes between equation is given by:

equation (14)

For numbers between 1 and 4 the minimum number of primes is:

equation

A positive fraction greater than zero would here implies that the number of primes between 1 and 4 is at least 1.

For numbers between 4 and 9 the minimum number of primes is given by:

equation

The number of primes is at least one.

For numbers between 81 and 100:

equation

The number of primes is at least 3.

From equation 14 we can establish that there is at least one prime number between every consecutive pair of square numbers. This verifies Legendre’s conjecture.

References