1

Yuriy E. Yatsyna
Exact Recurrence Formula for Prime Numbers
yuri.yatsyna@gmail.com


Theorem (exact recurrence formula for prime numbers).


( )
(
(
(
(
(

|
|
.
|

\
|
|
|
.
|

\
|

|
|
.
|

\
|
=

=

+
n
n
n
n
p n
j
p
j
p
k
p
n
p k p
4
1
1
1
4
1 4
1
4
1
1


where (
z
denotes the least integer which is no less than

z
.

Proof. Let us estimate the difference of the sum and the product
above, which we shall denote

A
. Owing to
( )

=
0
1
1
j
j

,
1 <
,
the main theorem of arithmetic, and

n n
p p 4
2
<
+
, we have

+
=

+

+
n
n n n
p k
p p
n
p
n
k p p A
4
4 4
2
4
1
.

As a result of

( )
n
n
n
n
n
n
p
n
p
n
p
p
p k
p
p p d k
4
2
4
1 4
4
4
4
1 4

+

= <

,

n
p
n
p A
4
1

+
>
.

Copyright Yuriy E. Yatsyna

2

On the other hand,

( )
n
n
n
n
n
n
p
n
p
p
p
p k
p
p d k A
4
1
1
4
1 4
4
1
1
1

< <

+
+



The two above estimates prove the theorem.

However, the above formula cannot be used for calculations due to
rapidly growing huge precision required.

The result of this article was obtained by the author in 1986.

How to donate. To support the author, please transfer any amount to
yuri.yatsyna@gmail.com PayPal account. If you would like to
contribute in any other way, contact the author at
yuri.yatsyna@gmail.com.
Copyright Yuriy E. Yatsyna