The New Prime theorems(841)-(890)
Jiang, Chun-Xuan (蒋春暄)
Institute for Basic Research, Palm Harbor, FL34682-1577, USA
And: P. O. Box 3924, Beijing 100854, China (蒋春暄,北京3924信箱,100854)
jiangchunxuan@sohu.com, cxjiang@mail.bcf.net.cn, jcxuan@sina.com, Jiangchunxuan@vip.sohu.com, jcxxxx@163.com
Abstract: Using Jiang function we are able to prove almost all prime problems in prime distribution. This is the Book proof. No great mathematicians study prime problems and prove Riemann hypothesis in AIM, CLAYMI, IAS, THES, MPIM, MSRI. In this paper using Jiang function J2( )
we prove that the new prime theorems (841)-(890) contain infinitely many prime solutions and no prime solutions. From (6) we are able to find the smallest solution
( 0, 2) 1
k N
. This is the Book theorem.
[Jiang, Chun-Xuan (蒋春暄). The New Prime theorems(841)(890)- . Academ Arena 2016;8(1s): 627-697]. (ISSN 1553-992X). http://www.sciencepub.net/academia. 13. doi:10.7537/marsaaj0801s1613.
Keywords: new; prime theorem; Jiang Chunxuan
It will be another million years, at least, before we understand the primes.
Paul Erdos (1913-1996) The New Prime theorem(841)
, 1602 ( 1, , 1)
P jP k j j k
Chun-Xuan Jiang
Jiangchunxuan@vip.sohu.com Abstract
Using Jiang function we prove that
jP1602 k j
contain infinitely many prime solutions and no prime solutions.
Theorem. Let k be a given odd prime.
, 1602 ( 1, , 1)
P jP k j j k . (1)
contain infinitely many prime solutions and no prime solutions.
Proof. We have Jiang function [1,2]
2( ) 2[ 1 ( )]
P
J P P
(2)
where P P
,( )P is the number of solutions of congruence
1 1602
1 0 (mod ), 1, , 1
k
j jq k j P q P
(3)
If ( )P P2 then from (2) and (3) we have
2( ) 0
J
(4)
We prove that (1) contain infinitely many prime solutions that is for any k there are infinitely many primes P such that each of
jp1602+k j
is a prime.
Using Fermat’s little theorem from (3) we have ( )P P1
. Substituting it into (2) we have
2( ) 0
J
(5)
We prove that (1) contain no prime solutions [1,2]
If J2( ) 0
then we have asymptotic formula [1,2]
1602 2 1 1
( , 2) : ~ ( )
(1602) ( ) log
k
k k k k
J N
N P N jP k j prime
N
(6)
where ( ) ( 1)
P P
.
From (6) we are able to find the smallest solution k(N0, 2) 1
. Example 1. Let k 3, 7,19,179
. From (2) and(3) we have
2( ) 0
J
(7)
we prove that for k 3, 7,19,179
(1) contain no prime solutions. 1 is not a prime.
Example 2. Let k3, 7,19,179.
From (2) and (3) we have
2( ) 0
J
(8)
We prove that for k3, 7,19,179,
(1) contain infinitely many prime solutions
The New Prime theorem(842)
, 1604 ( 1, , 1)
P jP k j j k
Chun-Xuan Jiang
Jiangchunxuan@vip.sohu.com Abstract
Using Jiang function we prove that
jP1604 k j
contain infinitely many prime solutions and no prime solutions.
Theorem. Let k be a given odd prime.
, 1604 ( 1, , 1)
P jP k j j k . (1)
contain infinitely many prime solutions and no prime solutions.
Proof. We have Jiang function [1,2]
2( ) 2[ 1 ( )]
P
J P P
(2)
where P P
,( )P is the number of solutions of congruence
1 1604
1 0 (mod ), 1, , 1
k
j jq k j P q P
(3)
If ( )P P2 then from (2) and (3) we have
2( ) 0
J
(4)
We prove that (1) contain infinitely many prime solutions that is for any k there are infinitely many primes P such that each of
jp1604+k j is a prime.
Using Fermat’s little theorem from (3) we have ( )P P1. Substituting it into (2) we have
2( ) 0 J
(5)
We prove that (1) contain no prime solutions [1,2]
If J2( ) 0
then we have asymptotic formula [1,2]
1604 2 1 1
( , 2) : ~ ( )
(1604) ( ) log
k
k k k k
J N
N P N jP k j prime
N
(6)
where ( ) ( 1)
P P
.
From (6) we are able to find the smallest solution k(N0, 2) 1
. Example 1. Let k 3,5. From (2) and(3) we have
2( ) 0
J
(7)
we prove that for k 3,5
,
(1) contain no prime solutions. 1 is not a prime.
Example 2. Let k3,5
. From (2) and (3) we have
2( ) 0
J
(8)
We prove that for k3,5,
(1) contain infinitely many prime solutions
The New Prime theorem(843)
, 1606 ( 1, , 1)
P jP k j j k
Chun-Xuan Jiang
Jiangchunxuan@vip.sohu.com Abstract
Using Jiang function we prove that
jP1606 k j
contain infinitely many prime solutions and no prime solutions.
Theorem. Let k be a given odd prime.
, 1606 ( 1, , 1)
P jP k j j k
. (1)
contain infinitely many prime solutions and no prime solutions.
Proof. We have Jiang function [1,2]
2( ) 2[ 1 ( )]
P
J P P
(2)
where P P
,( )P is the number of solutions of congruence
1 1606
1 0 (mod ), 1, , 1
k
j jq k j P q P
(3)
If ( )P P2
then from (2) and (3) we have
2( ) 0
J
(4)
We prove that (1) contain infinitely many prime solutions that is for any k there are infinitely many primes
P such that each of
jp1606+k j is a prime.
Using Fermat’s little theorem from (3) we have ( )P P1. Substituting it into (2) we have
2( ) 0
J
(5)
We prove that (1) contain no prime solutions [1,2]
If J2( ) 0
then we have asymptotic formula [1,2]
1606 2 1 1
( , 2) : ~ ( )
(1606) ( ) log
k
k k k k
J N
N P N jP k j prime
N
(6)
where ( ) ( 1)
P P
.
From (6) we are able to find the smallest solution k(N0, 2) 1
. Example 1. Let k 3, 23,1607
. From (2) and(3) we have
2( ) 0
J
(7)
we prove that for k 3, 23,1607
,
(1) contain no prime solutions. 1 is not a prime.
Example 2. Let k3, 23,1607
. From (2) and (3) we have
2( ) 0
J
(8)
We prove that for k3, 23,1607,
(1) contain infinitely many prime solutions
The New Prime theorem(844)
, 1608 ( 1, , 1)
P jP k j j k
Chun-Xuan Jiang
Jiangchunxuan@vip.sohu.com Abstract
Using Jiang function we prove that
jP1608 k j
contain infinitely many prime solutions and no prime solutions.
Theorem. Let k be a given odd prime.
, 1608 ( 1, , 1)
P jP k j j k . (1)
contain infinitely many prime solutions and no prime solutions.
Proof. We have Jiang function [1,2]
2( ) 2[ 1 ( )]
P
J P P
(2)
where P P
,( )P is the number of solutions of congruence
1 1608
1 0 (mod ), 1, , 1
k
j jq k j P q P
(3)
If ( )P P2 then from (2) and (3) we have
2( ) 0
J
(4)
We prove that (1) contain infinitely many prime solutions that is for any k there are infinitely many primes P such that each of
jp1608+k j is a prime.
Using Fermat’s little theorem from (3) we have ( )P P1. Substituting it into (2) we have
2( ) 0
J
(5)
We prove that (1) contain no prime solutions [1,2]
If J2( ) 0
then we have asymptotic formula [1,2]
1608 2 1 1
( , 2) : ~ ( )
(1608) ( ) log
k
k k k k
J N
N P N jP k j prime
N
(6)
where ( ) ( 1)
P P
.
From (6) we are able to find the smallest solution k(N0, 2) 1
. Example 1. Let k 3, 5, 7,13, 269,1609. From (2) and(3) we have
2( ) 0
J
(7)
we prove that for k 3, 5, 7,13, 269,1609
, (1) contain no prime solutions. 1 is not a prime.
Example 2. Let k3,5, 7,13, 269,1609.
From (2) and (3) we have
2( ) 0
J
(8)
We prove that for k3,5, 7,13, 269,1609,
(1) contain infinitely many prime solutions
The New Prime theorem(845)
, 1610 ( 1, , 1)
P jP k j j k
Chun-Xuan Jiang
Jiangchunxuan@vip.sohu.com Abstract
Using Jiang function we prove that
jP1610 k j contain infinitely many prime solutions and no prime solutions.
Theorem. Let k be a given odd prime.
, 1610 ( 1, , 1)
P jP k j j k . (1)
contain infinitely many prime solutions and no prime solutions.
Proof. We have Jiang function [1,2]
2( ) 2[ 1 ( )]
J P P P
(2)
where P P
,( )P is the number of solutions of congruence
1 1610
1 0 (mod ), 1, , 1
k
j jq k j P q P
(3)
If ( )P P2 then from (2) and (3) we have
2( ) 0 J
(4)
We prove that (1) contain infinitely many prime solutions that is for any k there are infinitely many primes P such that each of
jp1610
+k j
is a prime.
Using Fermat’s little theorem from (3) we have ( )P P1
. Substituting it into (2) we have
2( ) 0
J
(5)
We prove that (1) contain no prime solutions [1,2]
If J2( ) 0
then we have asymptotic formula [1,2]
1610 2 1 1
( , 2) : ~ ( )
(1610) ( ) log
k
k k k k
J N
N P N jP k j prime
N
(6)
where ( ) ( 1)
P P
.
From (6) we are able to find the smallest solution k(N0, 2) 1
. Example 1. Let k 3,11, 47, 71. From (2) and(3) we have
2( ) 0
J
(7)
we prove that for k 3,11, 47, 71,
(1) contain no prime solutions. 1 is not a prime.
Example 2. Let k3,11, 47, 71
. From (2) and (3) we have
2( ) 0
J
(8)
We prove that for k3,11, 47, 71,
(1) contain infinitely many prime solutions
The New Prime theorem(846)
, 1612 ( 1, , 1)
P jP k j j k
Chun-Xuan Jiang
Jiangchunxuan@vip.sohu.com Abstract
Using Jiang function we prove that
jP1612 k j contain infinitely many prime solutions and no prime solutions.
Theorem. Let k be a given odd prime.
, 1612 ( 1, , 1)
P jP k j j k . (1)
contain infinitely many prime solutions and no prime solutions.
Proof. We have Jiang function [1,2]
2( ) 2[ 1 ( )]
P
J P P
(2)
where P P
,( )P
is the number of solutions of congruence
1 1612
1 0 (mod ), 1, , 1
k
j jq k j P q P
(3)
If ( )P P2
then from (2) and (3) we have
2( ) 0
J
(4)
We prove that (1) contain infinitely many prime solutions that is for any k there are infinitely many primes P such that each of
jp1612
+k j
is a prime.
Using Fermat’s little theorem from (3) we have ( )P P1
. Substituting it into (2) we have
2( ) 0
J
(5)
We prove that (1) contain no prime solutions [1,2]
If J2( ) 0
then we have asymptotic formula [1,2]
1612 2 1 1
( , 2) : ~ ( )
(1612) ( ) log
k
k k k k
J N
N P N jP k j prime
N
(6)
where ( ) ( 1)
P P
.
From (6) we are able to find the smallest solution k(N0, 2) 1
. Example 1. Let k 3,5,53,1613
. From (2) and(3) we have
2( ) 0
J
(7)
we prove that for k 3,5,53,1613
,
(1) contain no prime solutions. 1 is not a prime.
Example 2. Let k3,5,53,1613
. From (2) and (3) we have
2( ) 0
J
(8)
We prove that for k3,5,53,1613,
(1) contain infinitely many prime solutions
The New Prime theorem(847)
, 1614 ( 1, , 1)
P jP k j j k
Chun-Xuan Jiang
Jiangchunxuan@vip.sohu.com Abstract
Using Jiang function we prove that
jP1614 k j
contain infinitely many prime solutions and no prime solutions.
Theorem. Let k be a given odd prime.
, 1614 ( 1, , 1)
P jP k j j k . (1)
contain infinitely many prime solutions and no prime solutions.
Proof. We have Jiang function [1,2]
2( ) 2[ 1 ( )]
P
J P P
(2)
where P P
,( )P
is the number of solutions of congruence
1 1614
1 0 (mod ), 1, , 1
k
j jq k j P q P
(3)
If ( )P P2 then from (2) and (3) we have
2( ) 0
J
(4)
We prove that (1) contain infinitely many prime solutions that is for any k there are infinitely many primes P such that each of
jp1614+k j is a prime.
Using Fermat’s little theorem from (3) we have ( )P P1. Substituting it into (2) we have
2( ) 0
J
(5)
We prove that (1) contain no prime solutions [1,2]
If J2( ) 0
then we have asymptotic formula [1,2]
1614 2 1 1
( , 2) : ~ ( )
(1614) ( ) log
k
k k k k
J N
N P N jP k j prime
N
(6)
where ( ) ( 1)
P P
.
From (6) we are able to find the smallest solution k(N0, 2) 1
. Example 1. Let k 3, 7. From (2) and(3) we have
2( ) 0
J
(7)
we prove that for k 3, 7
,
(1) contain no prime solutions. 1 is not a prime.
Example 2. Let k3, 7.
From (2) and (3) we have
2( ) 0
J
(8)
We prove that for k3, 7,
(1) contain infinitely many prime solutions
The New Prime theorem(848)
, 1616 ( 1, , 1)
P jP k j j k
Chun-Xuan Jiang
Jiangchunxuan@vip.sohu.com Abstract
Using Jiang function we prove that
jP1616 k j contain infinitely many prime solutions and no prime solutions.
Theorem. Let k be a given odd prime.
, 1616 ( 1, , 1)
P jP k j j k . (1)
contain infinitely many prime solutions and no prime solutions.
Proof. We have Jiang function [1,2]
2( ) 2[ 1 ( )]
J P P P
(2)
where P P
,( )P is the number of solutions of congruence
1 1616
1 0 (mod ), 1, , 1
k
j jq k j P q P
(3)
If ( )P P2 then from (2) and (3) we have
2( ) 0
J
(4)
We prove that (1) contain infinitely many prime solutions that is for any k there are infinitely many primes P such that each of
jp1616
+k j
is a prime.
Using Fermat’s little theorem from (3) we have ( )P P1
. Substituting it into (2) we have
2( ) 0
J
(5)
We prove that (1) contain no prime solutions [1,2]
If J2( ) 0
then we have asymptotic formula [1,2]
1616 2 1 1
( , 2) : ~ ( )
(1616) ( ) log
k
k k k k
J N
N P N jP k j prime
N
(6)
where ( ) ( 1)
P P
.
From (6) we are able to find the smallest solution k(N0, 2) 1
. Example 1. Let k 3,5,17,809. From (2) and(3) we have
2( ) 0
J
(7)
we prove that for k 3,5,17,809,
(1) contain no prime solutions. 1 is not a prime.
Example 2. Let k3,5,17,809.
From (2) and (3) we have
2( ) 0
J
(8)
We prove that for k3,5,17,809,
(1) contain infinitely many prime solutions
The New Prime theorem(849)
, 1618 ( 1, , 1)
P jP k j j k
Chun-Xuan Jiang
Jiangchunxuan@vip.sohu.com Abstract
Using Jiang function we prove that
jP1618 k j
contain infinitely many prime solutions and no prime solutions.
Theorem. Let k be a given odd prime.
, 1618 ( 1, , 1)
P jP k j j k . (1)
contain infinitely many prime solutions and no prime solutions.
Proof. We have Jiang function [1,2]
2( ) 2[ 1 ( )]
P
J P P
(2)
where P P
,( )P
is the number of solutions of congruence
1 1618
1 0 (mod ), 1, , 1
k
j jq k j P q P
(3)
If ( )P P2 then from (2) and (3) we have
2( ) 0
J
(4)
We prove that (1) contain infinitely many prime solutions that is for any k there are infinitely many primes P such that each of
jp1618+k j is a prime.
Using Fermat’s little theorem from (3) we have ( )P P1. Substituting it into (2) we have
2( ) 0
J
(5)
We prove that (1) contain no prime solutions [1,2]
If J2( ) 0
then we have asymptotic formula [1,2]
1618 2 1 1
( , 2) : ~ ( )
(1618) ( ) log
k
k k k k
J N
N P N jP k j prime
N
(6)
where ( ) ( 1)
P P
.
From (6) we are able to find the smallest solution k(N0, 2) 1
. Example 1. Let k 3,1619
. From (2) and(3) we have
2( ) 0
J
(7)
we prove that for k 3,1619
,
(1) contain no prime solutions. 1 is not a prime.
Example 2. Let k3,1619
. From (2) and (3) we have
2( ) 0
J
(8)
We prove that for k3,1619,
(1) contain infinitely many prime solutions The New Prime theorem(850)
, 1620 ( 1, , 1)
P jP k j j k
Chun-Xuan Jiang
Jiangchunxuan@vip.sohu.com Abstract
Using Jiang function we prove that
jP1620 k j
contain infinitely many prime solutions and no prime solutions.
Theorem. Let k be a given odd prime.
, 1620 ( 1, , 1)
P jP k j j k . (1)
contain infinitely many prime solutions and no prime solutions.
Proof. We have Jiang function [1,2]
2( ) 2[ 1 ( )]
J P P P
(2)
where P P
,( )P is the number of solutions of congruence
1 1620
1 0 (mod ), 1, , 1
k
j jq k j P q P
(3)
If ( )P P2 then from (2) and (3) we have
2( ) 0
J
(4)
We prove that (1) contain infinitely many prime solutions that is for any k there are infinitely many primes P such that each of
jp1620+k j is a prime.
Using Fermat’s little theorem from (3) we have ( )P P1. Substituting it into (2) we have
2( ) 0
J
(5)
We prove that (1) contain no prime solutions [1,2]
If J2( ) 0
then we have asymptotic formula [1,2]
1620 2 1 1
( , 2) : ~ ( )
(1620) ( ) log
k
k k k k
J N
N P N jP k j prime
N
(6)
where ( ) ( 1)
P P
.
From (6) we are able to find the smallest solution k(N0, 2) 1
.
Example 1. Let k 3,5, 7,11,13,19,31, 37, 61,109,163, 271,811,1621
. From (2) and(3) we have
2( ) 0
J
(7)
we prove that for k 3,5, 7,11,13,19,31, 37, 61,109,163, 271,811,1621,
(1) contain no prime solutions. 1 is not a prime.
Example 2. Let k3,5, 7,11,13,19, 31,37, 61,109,163, 271,811,1621
. From (2) and (3) we have
2( ) 0
J
(8)
We prove that for k3,5, 7,11,13,19, 31,37, 61,109,163, 271,811,1621,
(1) contain infinitely many prime solutions
The New Prime theorem(851)
, 1622 ( 1, , 1)
P jP k j j k
Chun-Xuan Jiang
Jiangchunxuan@vip.sohu.com Abstract
Using Jiang function we prove that
jP1622 k j
contain infinitely many prime solutions and no prime solutions.
Theorem. Let k be a given odd prime.
, 1622 ( 1, , 1)
P jP k j j k
. (1)
contain infinitely many prime solutions and no prime solutions.
Proof. We have Jiang function [1,2]
2( ) 2[ 1 ( )]
P
J P P
(2)
where P P
,( )P is the number of solutions of congruence
1 1622
1 0 (mod ), 1, , 1
k
j jq k j P q P
(3)
If ( )P P2
then from (2) and (3) we have
2( ) 0
J
(4)
We prove that (1) contain infinitely many prime solutions that is for any k there are infinitely many primes P such that each of
jp1622
+k j
is a prime.
Using Fermat’s little theorem from (3) we have ( )P P1
. Substituting it into (2) we have
2( ) 0
J
(5)
We prove that (1) contain no prime solutions [1,2]
If J2( ) 0
then we have asymptotic formula [1,2]
1622 2 1 1
( , 2) : ~ ( )
(1622) ( ) log
k
k k k k
J N
N P N jP k j prime
N
(6)
where ( ) ( 1)
P P
.
From (6) we are able to find the smallest solution k(N0, 2) 1
. Example 1. Let k 3. From (2) and(3) we have
2( ) 0
J
(7)
we prove that for k 3,
(1) contain no prime solutions. 1 is not a prime.
Example 2. Let k3. From (2) and (3) we have
2( ) 0
J
(8)
We prove that for k3,
(1) contain infinitely many prime solutions
The New Prime theorem(852)
, 1624 ( 1, , 1)
P jP k j j k
Chun-Xuan Jiang
Jiangchunxuan@vip.sohu.com Abstract
Using Jiang function we prove that
jP1624 k j contain infinitely many prime solutions and no prime