Academia Arena 2017;9(5) http://www.sciencepub.net/academia
118
There are finite Mersenne primes and There are finite repunits primes
Chun-Xuan Jiang
P. O. Box 3924, Beijing 100854, P. R. China [email protected]
Abstract: Using Jiang function we prove the finite Mersenne primes and the finite repunits primes.
[Chun-Xuan Jiang. There are finite Mersenne primes and There are finite repunits primes. Academ Arena 2017;9(5):118-119]. ISSN 1553-992X (print); ISSN 2158-771X (online). http://www.sciencepub.net/academia. 8.
doi:10.7537/marsaaj090517.08
Keywords: prime; theorem; function; number; new
Theorem. Suppose the prime equation
0
1
( 1) 1 2 P
PP P
. (1)
where P
0is a given prime.
There exist infinitely many primes P such that P
1is a prime.
Proof. We have Jiang function[1]
2
( ) [ 1 ( )]
J
PP P
, (2)
where
PP
, ( ) P is the number of solutions of congruence
( 1)
01
0 (mod ) 2
q
Pq P
, q 1, , P 1
. ( 3 )
( ) 1 P
0
, ( ) P P
0 1
if P 1 (mod P
0)
, ( ) P 0 otherwise.
Since J
2( ) 0
, there exist infinitely many primes P such that P
1is a prime.
We have the asymptotic formula [1]
22 1 2 2
0
( )
( , 2) : ~ 1
1 ( ) log
J N
N P N P prime
P N
. ( 4 )
where ( ) ( 1)
P
P
.
Let P 3 . From (1) we have equation of Mersenne numbers [2]
0
1
2
P1
P
. (5)
From (4) we have
0
22 2 2
0
( )
1 3
(3, 2) 3 : 2 1 ~ 0
1 ( ) log 3
P
J
N prime
P
as P
0
(6)
We prove the finite Mersenne primes.
Let P 11 . From (1) we have equation of repunits numbers [2]
0
1
10 1 9
P
P
. ( 7 )
From (4) we have
Academia Arena 2017;9(5) http://www.sciencepub.net/academia
119
0
2
11 2 2
0
10 1 1 ( ) 11
(11, 2) 11 : ~ 0
9 1 ( ) log 11
P