Brocard's Conjecture: The Diophantine Equation Initial Solutions For N 5
Uploaded by
Nikos MantzakourasBrocard's Conjecture: The Diophantine Equation Initial Solutions For N 5
Uploaded by
Nikos MantzakourasBrocards Conjecture
Mantzakouras Nikos, May 2015
Brocard conjecture in 1904 that the only solution of n! m 2 1 are n=4,5,7.
There are no other solutions with n 10 9 .(Berndt and Galway n.d).Another of
Brocards conjecture is that there are at least four primes between the squares
of any two consecutive primes ,with the exception of 2 and 3.This related to
Schinzels conjecture that,provided x is greater than 8,there is a prime between x
and x (log x) 2 .(See Oppermans conjecture),[1].
The diophantine equation n! m 2 1
Initial solutions for n<=5
I)
First we need to calculate two initial solutions when n = 4 and n = 5.
Like Applies easily calculated , if we put m=2x+1 x Z into in
Brocard equation and then we have the relation n! m 2 1 4 x( x 1)
(1) . This because for these values of n we have m odd number.
Similarly we find (n 1)! m'2 1 4 y ( y 1) (2), by y Z .From
relations (1),(2) we conclude that (n 1) x( x 1) y( y 1) (3).
II)
From(2&3) if call y=(n+1)=> (n 1)! 4(n 1)(n 2) n! 4(n
2)
.The last has solution n=4 and m=5.
III)
Also from (2) we have if n / n 1 and y n / then
n / ! 4 n / (n
/ 1) n / 5 and m=11. Therefore prove for values where
n=4 and n=5.
Generalization for n>5
From the original equation n! m2 1 n!(m - 1)
(m
1)then if m=2k+1, k Z
i.e n!(m - 1)
.Also if from n! 2 3 4 5 p q with p, q Z and
(m
1)
4 k (k
1)
.(4), that means the system..
n! 2 3 4 5 p q 4 (6
p)
(5
q)
4 k (k
1)
k 5 q
, p, q Z
k 1 6 p
From the previous system resulting equation 6 p - 5 q 1 .But should apply if we
have p w then q w 1 and 6 w - 5 (w
1)
1 w 6 and w 1 7 .
More specifically examine two cases: If 6 p - 5 q = 1 has solutions p = 1 + 5 k and
q = 1 + 6 k , k Z and if 6 p - 5 q = - 1 has solutions p = 4 + 5 k and q = 5 + 6 k . The
first solutions it is true, because if k=1 ,p=6 && q=7 .
In second case p=4 && q=5 we already know and is truth for k=0, but not for our
case ,because we want n> 5, therefore only exist the case 6 p - 5 q = 1 . Also we
need k Z and p q 1 then we have if 6 p - 5 q = 1 => p q k (5) and too
if 6 p - 5 q = - 1 then p q k 1 (6).The satisfaction of two cases occurs for the
first k= 1, and also the second by k = 0. But the first is the desired and
acceptable.
The case m=2k, k Z does not exist ,because the right part of the eq. n! m2 1
is odd and the left even which is impossible thing. To this end therefore accept
for n>5 only n = 7 and m=71,without another n order to comply, with the
criterion of factorial(n!), that the next number to be increased to the previous 1
unit. We see therefore that the Brocard conjecture has only solution of n! m2 1
the values n=4,5,7.
Bibliography
[1].The most Mysterious figures in Math. David Wells.
[2].Brocards problem and variations Yi Liu.
