• 検索結果がありません。

k JPPkP ()(1)[(1)(2)]0  kP  Pk 

N/A
N/A
Protected

Academic year: 2021

シェア "k JPPkP ()(1)[(1)(2)]0  kP  Pk "

Copied!
2
0
0

読み込み中.... (全文を見る)

全文

(1)

Academia Arena 2016;8(2) http://www.sciencepub.net/academia

151

New prime K-tuple theorems(1)

1

,

2

,

1 2

( 1, , )

P P PjPj j   k

and

P P P

1

,

2

,

1

jP

2

j j (  1,  , ) k

Chun-Xuan, Jiang (蒋春暄)

Institute for Basic Research, Palm Harbor, FL34682-1577, USA

And: P. O. Box 3924, Beijing 100854, China (蒋春暄,北京3924信箱,100854)

[email protected], [email protected], [email protected], [email protected], [email protected]

Abstract: Using Jinag funciton we prove that there exist infinitely many primes

P

1

and

P

2

such that each of

1 2

PjPj

is prime and there exist infinitely many primes

P

1

and

P

2

such that each of

P

1

jP

2

j

is prime.

[Chun-Xuan, Jiang. New prime K -tuple theorems(1)

P P P

1

,

2

,

1

jP

2

j j (  1,  , ) k

and

1

,

2

,

1 2

( 1, , )

P P PjPj j   k

. Academ Arena 2016;8(2):151-152]. ISSN 1553-992X (print); ISSN 2158-771X (online). http://www.sciencepub.net/academia. 6. doi:10.7537/marsaaj08021606.

Keywords: new; prime; function; number

Theorem 1.

1

,

2

,

1 2

( 1, , )

P P PjPj j   k

(1) There exist infinitely many primes

P

1

and

P

2

such that each of

P

1

jP

2

j

is prime.

Proof. We have Jiang function [1, 2]

2

3

( ) [( 1) ( )]

P

J

  P 

P

(2)

where

  

P

P

( )

P

is the number of solutions of congruence

1 2

1

( ) 0 (mod )

k

j

q jq j P

  

,

q

i

 1,  , P  1, i  1, 2.

(3)

From (3) we have

If

kP

then

( )

Pk P

(

2)

. If

Pk

then

( )

P

(

P

1)(

P

2)

. From (3) and (2) we have

2

3

( )

3

( 1) [( 1) ( 2)] 0

P k

P k P

JP P k P

       

(4)

For any positive integer

k

there exist inifinitely many primes

P

1

and

P

2

such that each of

P

1

jP

2

j

is prime.

We have asymptotic formula [1, 2]

 

2 3

1 1 2 1 2 2 2

( ,3) , : ~ ( )

( ) log

k

k k k

J N

N P P N P jP j prime

N

  

 

    

, (5)

where

( ) ( 1)

P

P

    

. Example 1.

1

,

2

,

1 2

1

P P PP

. (6)

(2)

Academia Arena 2016;8(2) http://www.sciencepub.net/academia

152 From (4) we have

2

3

( )

3

[( 1) ( 2)] 0

J

P

P P

 

   

(7)

From (5) we have

2

2 3 3 3

( , 3) ~ 2 1 1

( 1) log

P

N N

P N

 

   

  

(8)

Example 2.

1

,

2

,

1 2

1,

1

2

2

2

P P PPPP

. (9)

From (4) we have

2

3

( )

3

[( 1) 2( 2)] 0

J

P

P P

 

   

(10)

From (5) we have

2 2

3

3 4 4

( ,3) ~ ( )

( ) log

J N

N N

  

 

. (11)

Example 3.

1

,

2

,

1 2

( 1, ,8)

P P PjPj j  

. (12)

From (4) we have

2

3

( ) 48

11

[( 1) 8( 2)] 0

J

P P P

     

. (13)

From (5) we have

8 2

3

9 10 10

( ,3) ~ ( )

( ) log

J N

N N

  

 

. (14)

Theorem 2.

1

,

2

,

1 2

( 1, , )

P P PjPj j   k

, (15)

we have Jiang function

2

3

( )

3

( 1) [( 1) ( 2)] 0

P k

P k P

J

P P k P

       

. (16)

For any positive integer

k

there exist infinitely many primes

P

1

and

P

2

such that each of

P

1

jP

2

j

is prime.

we have asymptotic formula

 

2 3

1 1 2 1 2 2 2

( ,3) , : ~ ( )

( ) log

k

k k k

J N

N P P N P jP j prime

N

  

 

    

.(17) References

1. Chun-Xuan Jiang, Jiang’s function

J

n1

( ) 

in prime distribution. (http:// www. Wbabin. net/math/xuan2.

pdf) (http://vixra.org/pdf/0812.0004v2.pdf)

2. Chun-Xuan Jiang, The Hardy-Littlewood prime

k

tuple conjecture is false.

http://www.wbabin.net/math/xuan77.pdf

2/24/2016

参照

関連したドキュメント

Keywords: new; prime; k-tuple; theorem; Jiang Chunxuan; mathematics; science; number;

The tool of additive prime number theory is basically the Hardy-Littlewood prime tuple conjecture, but can not prove and count any prime problems[6]. Mathematicians

The tool of additive prime number theory is basically the Hardy-Littlewood prime tuple conjecture, but can not prove and count any prime problems[6]. Mathematicians

The tool of additive prime number theory is basically the Hardy-Littlewood prime tuple conjecture, but can not prove and count any prime problems[6]. Mathematicians have

Chun-Xuan Jiang, Foundations of Santilli’s isonumber theory with applications to new cryptograms, Fermat’s theorem and Goldbach’s conjecture.. Littlewood, Some problems

The tool of additive prime number theory is basically the Hardy-Littlewood prime tuple conjecture, but can not prove and count any prime problems[6].. Hardy

The tool of additive prime number theory is basically the Hardy-Littlewood prime tuple conjecture, but can not prove and count any prime problems[6].. Mathematicians

The tool of additive prime number theory is basically the Hardy-Littlewood prime tuple conjecture, but can not prove and count any prime problems[6].. Mathematicians