The New Prime Theorem 10 There Are Finite Mersenne Primes and There Are Finite Repunits Primes

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

The New Prime theorem10 There are finite Mersenne primes and There are finite repunits primes

Chun-Xuan Jiang P. O. Box 3924, Beijing 100854, P. R. China jiangchunxuan@vip.sohu.com Abstract Using Jiang function we prove the finite Mersenne primes and the finite repunits primes. Theorem. Suppose the prime equation P 1 = where P0 is a given prime. There exist infinitely many primes P such that P 1 is a prime. Proof. We have Jiang function[1] ( P 1) P0 1 . P2 1

J 2 ( ) = [ P 1 ( P)] ,
P

where = P , ( P) is the number of solutions of congruence


P

(q 1) P0 1 0 (mod P) , q2

q = 1,L , P 1 .

( P0 ) = 1 , ( P) = P0 1 if P 1 (mod P0 ) , ( P ) = 0 otherwise.
Since J 2 ( ) 0 , there exist infinitely many primes P such that P 1 is a prime. We have the asymptotic formula [1]

2 ( N , 2) = { P N : P 1 = prime} ~
where ( ) = ( P 1) .
P

1 J 2 ( ) N . P0 1 2 ( ) log 2 N

Let P = 3 . From (1) we have equation of Mersenne numbers [2]


P0 P 1 = 2 1 .

From (4) we have


1

2 (3, 2) = {3 N : 2 P 1 = prime} ~
0

1 J 2 ( ) 3 0 P0 1 2 ( ) log 2 3

as P0

We prove the finite Mersenne primes. Let P = 11 . From (1) we have equation of repunits numbers [2] P 1 =

10 P0 1 . 9

From (4) we have

11 (11, 2) = 11 N :

10 P0 1 1 J 2 ( ) 11 = prime ~ 0 2 2 9 P0 1 ( ) log 11

as P0 .8

We prove the finite repunits primes.


P0 In the same way we are able to prove that (a 1)

(a 1)

with a = 4, 6,10,12,L , has the

finite prime solutions.


Reference
[1] Chun-Xuan Jiang, Jiangs function J n +1 ( ) in prime distribution. http://www. wbabin.net/math /xuan2. pdf. [2] P. Ribenboim, The new book of prime number records, 3rd edition, spring-Verlag, New York, NY, 1995.

You might also like