A P P L e P I e o R D e R

2
A P P L E P I E O R D E R
It doesn’t fit the margin, but it does go in my book.
„The scientist dose not study Nature because it is useful; he studies it because he delights in it,
and he delights in it because it is beautiful. If Nature were not beautiful, it would not be worth
knowing, and if Nature were not worth knowing, life would not be worth living.”
Jules Henri Poincaré.
"Sed omnia in mensura, et numero, et pondere diposuisti.” Sapientia 11, 21.
“Mathematicians do not study objects, but relations between objects. Thus, they are free to
replace some objects by others so long as the relations remain unchanged. Content to them is
irrelevant: they are interested in form only”.
Jules Henri Poincaré.
For the memory of

Katharina Lubina
March 7, 2009
3
World and all what oneself it on him finds it carries mathematical structures. So God created
him with mathematical point of sight. Given the man the strength to him from God of reason,
plan of his building can the discoveries. It is the mathematics so the key to understanding of
world. In peer with her development, she went the change of aims what her was placed. It
does not serve the mathematics the endeavor to better perception only and the understanding
of nature, but it has to permit her to master.
Both points of sight, chief place of mathematics, strength of granted her certainty and the
incontestability, which are useful different disciplines scientific character, as also change of
this, what oneself it under this notion understands and what it the thanks were wanted was to
reach her, they gave the beginning my trials they would solve problem of primes. So began
my adventure with primes.
Human spirit and human culture they unrolled such formal system of thinking, to can
formulae recognize, to classify and to use. We call him mathematics, because it is
mathematician the science of formulae.
The only right of existence for mathematician, the desire of discovery of new formulae is and
the inherent in rights of nature regularities, as and announcing this, what it will happen.
Though looking for formulae and structures it is mathematician's activity, then proper his task
is formulation there in irrefutable proofs.
Numbers are the simplest mathematical object, and the simplest formulae of nature are
numerical, because perfect relations between numbers reign.
The basic theorem of algebraically theory of numbers sounds: All numbers descend from one.
.
"O M N I A E X U N O”
Theorem this be leaning on system of certainties, what Italian mathematician Giuseppe Peano
in 1889 r. submitted on unquestionable truth the undemanding proof "parental power” of
number one, giving the same bearing foundation theorem taking out from one all natural
numbers.
The forcible model of principle "all of one”/ OMNIA EX UNO / is the draught of natural
numbers 1, 2, 3, 4,.. in which number one, it is for all numbers the "point of exit”. One is
really only corner stone the whole draught of numbers on which is bases here. In gathering of
natural numbers the number one is the class alone for me, the "Unity” is called also from here.
One is only number, which does not change when oneself it divide her by her, or it increases.
Geometric he be introduced as point, by what his elusiveness be expressed. Point's the lack of
length, width and height, upper or bottom side, any color, and even the position.
It was cannot say even, points are round, because taking at all closely they do not widen. This
borders on with miracle directly, that attributes number these essential and necessary features
without which the whole draught of natural numbers would not can exist. Then she is the
"Point” of reference, what to which all natural numbers graphic be co-ordinated, introduced
on two co-ordinates a, and b. She is the "source” even and odd units also from which it comes
into being whole row of prime and folded numbers. It exist such "Unity”, from which the
whole wealth of world results, as one axiom will suffice as foundation the fine edifice of
arithmetic.
"It exist such number 1 possessing property, which treats to every number - n”:
n · 1= n = n + 0 1 · p = p
4
Really comparative size with 2 enters in life, in support about which , all different
measurable can pit .She beyond this is with nature the number of "unification” from two
unit's make one number.
2+1
1= 3
2+1 2+1
2= 3 + 3
p±1
p= a + b b= p- a a= 3
p±1 p±1
+( p− )
p= 3 3 p= a + (p - a)
Prime numbers this "building blocks”, from which be built all different natural numbers. Not
we will find them however in multiplication table, because number first cannot be the result
"sensible” operation of multiplication, but only addition.
Every prime numbers is the sum two components defining her place in draught of natural
numbers p = a + b.
p±1
Component a = 3 then they came into being with divisible numbers even quotient by 3.
Component b = p - a then difference among prime number, and even quotient.
It number 2 is only even prime number and across her principle "larger about one” it will
become transferred on next natural numbers, guaranteeing contact and progress in draught.
2+1
1= 3
2 = 1 + 1
1
3 = 1 + 2 = 1 + (3 - 1)
1
4 = 2 + 2
1
5+1 5+1
5 = 2 + 3 = 3 + (5 - 3 )
1
6 = 3 + 3
7−1 7−1
7 = 2 + 5 = 3 + (7 - 3 )
1
8 = 3 + 5
All prime numbers precede or they follow after divisible number by 3 e.g. 2, 3, 5, 6, 7, 17, 18,
19, 23, 24, for except 3 even. Eureka! “I’ve found it”
5
p ±1=2 n 17 + 1 = 18 = 19 – 1 because 3(p −1 )=2 n 3(7-1) =

18
p ±1=2 n 5+1=6=7–1 because 3(p −1 )=2 n 3(3-1)
=6
5 11 17 23 29 41 47 59 71 83 101 107 113 131

6 12, 18, 24, 30, 36, 42, 48, 54, 60, 66, 72, 78, 84, 90, 96, 102, 108, 114, 120, 126, 132,
7 13 19 31 37 43 61 67 73 79 97 103 109 127
Prime number is about one larger or smaller from previous or following even divisible
number by 3.
p = 2n ±1 e.g. 1999 = 1998 + 1
Odd numbers, as this results from every multiplication table, are product of prime numbers,
and almost prime.
n
3 = b n = 3 b (2 b + b)
9 = 2 (3) + 3
In odd numbers the relation of even components to odd is always 2 : 1,

we can from here write n = 2b + b e.g. 15 = 2(5) + 5 21 = 2(7) + 7
If decomposes the sum of units of number on the components the being in relation expressed
in equation n = 2b + b, then it is surely then the odd number.
Triangle of numbers.
"Number is collection of units”, Euclid defines her in VII book "Elements” definition 2 so.
"Tria juncta in uno" / Three join in one / In triangle of numbers the Principle "larger about
one" the links units in integers.
If decomposes the sum of individuals of number on the components the being in relation
expressed in equation p = a + ( p - a) this is surely then prime number.
If every number natural larger from one, can be written in aspect of the sum of unity or the
sum primes, and “unity ” is quotient of the sum of prime and “unity” by next number prime,
then the infinite sum of natural numbers is equals infinite sum “unity”,
4= 1+1+1+1 SN ∞=∑ 1∞
e. g.
6
Since natural numbers is infinitely many, then and primes is infinitely many, because all
different with them consist, and what with this goes also pair of twin primes. This is yet
completely comprehensible! And simultaneously not natural in natural numbers.
All natural numbers which carry in me principle “larger about one”, can be written as the sum
of ones, or primes 2 and 3.
2+1
2k = p + ¥p… 2k = ∞(2) 1= 3 n = p’ + ¥p’ n = ∞(3)
1 + 1 = 2 = 1(2)
1 + 1 + 1 = 3 = 1(3)
1+1+1+1=4=2+2
1+1+1+1+1=5=2+3
1+1+1+1+1+1=6=2+2+2
1+1+1+1+1+1+1=7=2+2+3
1 + 1 + 1 + 1 + 1 + 1+ 1 + 1 = 8 = 2 + 2 + 2 + 2
1+1+1+1+1+1+1+1+1=9=3+3+3
1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 =10= 2 + 2 + 2 + 2 + 2
1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 =11= 2 + 2 + 2 + 2 + 3
1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 =12= 2 + 2 + 2 + 2 + 2 + 2
1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 =13= 2 + 2 + 2 + 2 + 2 + 3
1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 =14= 2 + 2 + 2 + 2 + 2 + 2 + 2
1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 =15= 3 + 3 + 3 + 3 + 3
15 + 1 =16= 2 + 2 + 2 + 2 + 2 + 2 + 2 + 2
16 + 1 =17= 7(2) + 1(3) p = n(p) + p’
17 + 1 =18= 9(2)
7
18 + 1 =19= 8(2) + 1(3)

19 + 1 =20= 10(2)
24 + 1 =25=5(2) + 5(3) „p”= n(p) + n(p’)
34 + 1 =35=7(2) + 7(3)
∞ +1= ∞
Every number prime 3 consists from 3 and number even, not divided by three.
p = 3 + (p – 3) p – 3 = 2n p = n(2) + 3
1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+1+
\ 3 / + \ 2/ +\2 / +\ 2 /+\ 2/ +\ 2 /+ \ 2/ +\2/ + \2/ + \2/ + \2/
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24
p = n(2) + 3
23 = 10(2) + 1(3) 37 = 17(2) + 1(3)
29 = 13(2) + 1(3) 41 = 19(2) + 1(3)
31 = 14(2) + 1(3) 43 = 20(2) + 1(3)
47 = 22(2) + 1(3) 67 = 32(2) + 1(3)
53 = 25(2) + 1(3) 71 = 34(2) + 1(3)
59 = 28(2) + 1(3) 73 = 35(2) + 1(3)
61 = 34(2) + 1(3) 79 = 38(2) + 1(3)
83 = 40(2) + 1(3) 89 = 43(2) + 1(3)
97 = 47(2) + 1(3) 107 = 52(2) + 1(3)
101 = 49(2) + 1(3) 109 = 53(2) + 1(3)
103 = 50(2) + 1(3) 113 = 55(2) + 1(3)
The whole infinite file of natural numbers consists from infinite quantity 2 and 3, which are
“units” all numbers.
ÎN¥ = ¥(2) + ¥(3) = ¥(1)
2+1
¿ N¥ = ¿ ¥1= ¿ ¥ 3
2+1
Alone meanwhile “units” they are even and odd multiplicity “unity” 1 = 3 1(2), 1(3).
In this way was proved mathematically indirectly that all numbers descend from one, because
they consist from “units”.
P=
p±1
3
+2 [ ]
p±1
3
±1
e. g. 179 =
179+1
3
+2 [
179+1
3
−1 ]
p = [ 2(k) – 2] + 3 727 = [ 2(363) – 2] + 3 = (726 – 2) + 3
As to that indivisibility, Euler announced, that possesses algebraically proof on existence God.
n
a+b
=x
His form looked so: n , hence God exists. If in place of algebraically signs to
substitute three first numbers, then for mathematician equation this can to be proof on
3
2+1
=1
indivisibility number 3 3 . Philosopher can tell, that only plurality can to get unite.
8
Theologian meanwhile it will say: Father and Son with triple only Holy Spirit it is indivisible
Holy trinity, hence exists one God in three persons. And all are right, because plurality is the
form of unity.
See this on example primes, which despite that they consist from many individuals, they exist
as individual indivisible numbers.
On beginning of plan of building cosmos were primes, in which God’s similarity be reflects.
Decoding code of primes is decoding God’s secret formula and the riddle of universe. In
glitter apple pie order reigning in world of numbers, we recognize me and different the
creation’s wonders.
How the slide-fastener closes the principle "larger about one” the even numbers and odd in
one draught of numbers.
They three numbers create base.
Three is first number folded 2 + 1 = 3 how Pythagoras qualified this which has beginning,
centre and end, and only which only one of these modules possesses as united plurality.
9
2+1
1=
( )
3
6 7
2+1 2+1
2 3 4 5 1=
( ) 1= ( )
3 3
2+1 2+1 2+1
1=
( )
3 1=
( 3 ) 1= ( 3 ) 1=
( 2+3 1 )
2+1
1=
( 3 ) 1=
( 2+13 )
1=
( 2+1
3 ) 1=
( 2+1
3 ) 1=
( 2+1
3 ) 1=
( 2+3 1 ) 0-----------1=
( 2+1
3 ) ------------- 1 =
( 2+1
3 )
2+1 2+1 2+1 2+1
--------------------- 1 =
( 3 ) 1=
( 3 ) 1=
( 3 ) 1=
( 3 ) 1=
( 2+3 1 ) 1 = ( 2+13 ) 1 = ( 2+13 )

2+1 2+1 2+1
1=
( 3 ) 1= ( 3 ) 1= ( 3 ) 1=
2+ 1
(3)
2+1 2+1
1=
( 3 ) 1=
( 3 )
Three, as all odd numbers possesses symmetry creator "centre”. Centre of three is two,
quintuple the three, seven the five etc, hence with 2 and 3 consist all natural numbers and the
three the state "centre” of all odd numbers, and all natural numbers are the quotient of three.
Every plurality is the plurality of „units”.

2+ 1
ÎN=Î1
( 3 )
From those "units" be folded the whole cosmos, world of minerals, plants, animals and human
existences. "Man was created on range and similarity of only God's”, it tells us so many
belief, "all consists from the smallest and indivisible particles” - natural sciences teach so.
Both on their way struggle about formulating one and the same truth: Such Unity is, from
which whole plurality descends.
0
=0
0:1= 3
2+1 3
= =1
3 3
10
2+1 2+1 6
+ =2
3 3 = 3
2+1 2+1 2+1 9
+ = =3
3 3 + 3 3
2+1 2+1 2+1 2+1 12
+ + =4
3 3 + 3 3 = 3
2+1 2+1 2+1 2+1 2+1 15
+ + = =5
3 3 + 3 3 + 3 3
2+1 2+1 2+1 2+1 2+1 2+1 18
+ + + =6
3 3 + 3 3 + 3 3 = 3
2+1 2+1 2+1 2+1 2+1 2+1 2+1 21
+ + + = =7
3 3 + 3 3 + 3 3 + 3 3
2+1 2+1 2+1 2+1 2+1 2+1 2+1 2+1
+ + + +
3 3 + 3 3 + 3 3 + 3 3 =
24
=8
3
2+1 2+1 2+1 2+1 2+1 2+1 2+1 2+1
+ + + +
3 3 + 3 3 + 3 3 + 3 3 +
2+1 27
= =9
3 3
2+1 2+1 2+1 2+1 2+1 2+1 2+1 2+1 2+1 2+1
+ + + + +
3 3 + 3 3 + 3 3 + 3 3 + 3 3
30
=10
= 3
The pair’s of twin numbers.
If sum two following numbers prime form n and n + 2, it is divisible by 12, then they are
surely then twin numbers.
p+( p +2)
p + (p`+ 2) = 12
12 24 36 60 84
/ \ / \ / \ / \ / \
5+ 7 11 + 13 17 + 19 29 + 31 41 + 43
"Twin” call pair of numbers prime between which steps out the even number divisible by 3,
e.g. 5-6-7, 11 -12- 13, 17-18-19, 29-30- 31, 41 -42- 43, 59-60- 61,. it but not pair 131 -132-
133, or 10 000 037 -10 000 038- 10 000 039, it because 3, 4 and 6 number can was take apart
on prime factors 133 = 7(19), 10 000 039 = 7(1 428 577), 10 000 037 = 43(232 559).
Divide the sum of twin pair by 12, we will find out near which following even number
30137+30139
=5023
divisible by 3, came into being numbers prime. 12 because 5023 · 6 =
30138/3
11
During when sequence of the reciprocal of primes is divergent / with reason of growing space
1
∑ p
=∞
(n) 6 / pprim , sequence of the reciprocal of all twin numbers is convergent / because
∑ 1p + p+2( 1
)
they near mutually on distance 2/ p+2 prim < ∞, and his exact value be well-
known!
The six- wide array further helps to demonstrate the otherwise still unproven conjecture that
there must be infinitely many twin primes.
In the six- wide rectangular array, the consecutive multiples of each number higher than three
lay on a straight line from zero to that number and beyond, and on periodic parallels to that
line further “down” if we begin writing the numbers from the “top” of the array. Soon after
this “factor line” leaves the array rectangle on one side, a parallel to it re- enters it on the other
side, farther down in the array at the next such multiple. Each so broken factor line thus
cascades in evenly spaced stripes down the layers of the array. Whenever the factor lines from
all the primes above a given layer in the six- wide array happen to miss the two spaces before
and after the 6n column in that layer, the entries there are not multiples of any among those
prior primes. They are therefore primes themselves and from a pair of twin primes, as
illustrated in following table. This approach to the way Euclid suggested to multiply all the
primes, up to a supposedly “largest” one, with each other. He imagined this equally unfeasible
multiplication to show that the result plus or minus one is either a prime, or else the product
of two or more primes larger than the previously “largest”. By this method, he proved that
there always exists a prime larger than any allegedly “largest” one, and that there must thus be
an infinite quantity of them.
It is from in pair’s twin numbers similarly. Always the foundling oneself the larger pair of
twin numbers from allegedly "largest”, and by then sequence there has not the end.
0 1 2 3
4 5 6 7 8 9
10 11 12 13 14 15
16 17 18 19 20 21
22 23 24 25 26 27
28 29 30 31 32 33
34 35 36 37 38 39
40 41 42 43 44 45
46 47 48 49 50 51
52 53 54 55 56 57
58 59 60 61 62 63
64 65 66 67 68 69
70 71 72 73 74 75
76 77 78 79 80 81
82 83 84 85 86 87
88 89 90 91 92 93
94 95 96 97 98 99
100 101 102 103 104 105
12
106 107 108 109 110 111

112 113 114 115 116 117
118 119 120 121 122 123
124 125 126 127 128 129
130 131 132 133 134 135
136 137 138 139 140 141
142 143 144 145 146 147
148 149 150 151 152 153
154 155 156 157 158 159
160 161 162 163 164 165
166 167 168 169 170 171
172 173 174 175 176 177
178 179 180 181 182 183
184 185 186 187 188 189
190 191 192 193 194 195
196 197 198 199 200 201
202 203 204 205 206 207
208 209 210 211 212 213
214 215 216 217 218 219
The sum the pair of twin numbers equals sum of first three successive the pair as the
triangular multiplicities number 12, and the next different multiplicities in dependence from
this, which they in turn are the pair with infinite set of numbers.
∑ 12(1,3,6)+12(n )∞∈N p+( p +2)
=n
p+( p+2) 12
If you look at the distribution list of the first 4 primes you’ll see that it contains two twin
primes (5 7), in 25 prime numbers are already 14 twin primes (5 7, 11 13, 17 19, 29 31, 41 43,
59 61, 71 73) in 168 prime numbers there are 68 twin primes and in 1229 prime numbers even
408th. The question is not whether there are infinitely many twin primes, how special are the
twin primes distributed in the primes. Response you see in prime number distribution. As the
asymptotically decreasing number of primes in hidden geometric sequence 3 (q) the sum of
the differences between primes and almost primes grows, so too grows the sum of the
differences between almost primes nd(pp’), twin primes d(p, p’) and remaining primes dr(p).
nd(pp ') + d (p, p') + dr (p) = 3(q) 9 + 12 + 9 = 3(10) 157 + 54 + 89 = 30(10)
2 + 12 = 14 + 54 = 68 + 340 = 408 2 + 9 = 11 + 89 = 100 + 721 = 821
2 + 2 = 4 14 + 11 = 25 68 + 100 = 168 408 + 821 = 1229
nd(pp') 3(q) dr(p) d(p, p') p n(p, p')

0 3 2 2 4 2
9 30 9 12 25 14
157 300 89 54 168 68
1 939 3 000 721 340 1 229 408
2 5 11 17 23 29 41 47 53 59 71
3 7 13 19 31 37 43 61 67 73
2 83 89 10 10 113 13 13
1 7 1 7
13
2 79 97 10 10 12 13
3 9 7 9
3 14 167 17 17 19 19
9 3 9 1 7
3 15 15 16 18 19 19 211
1 7 3 1 3 9
4 22 23 239 25 25 26 26 28
7 3 1 7 3 9 1
4 22 22 241 27 27 28
3 9 1 7 3
5 29 311 31 34 35 359
3 7 7 3
5 30 313 33 33 34
7 1 7 9
6 383 38 40 41 431
9 1 9
6 36 37 37 39 40 42 433
7 3 9 7 9 1
7 44 44 46 46 47 49 503
3 9 1 7 9 1
7 43 457 46 48 49
9 3 7 9
8 50 52 55 56 56
9 1 7 3 9
8 52 54 54 57 577
3 1 7 1
9 58 59 599 61 64 647
7 3 7 1
9 601 60 61 61 63 64
7 3 9 1 3
1 65 65 67 68 70 719
0 3 9 7 3 1
1 66 673 69 70
0 1 1 9
11 743 76 77
1 3
11 72 73 73 75 75 76 78
7 3 9 1 7 9 7
1 79 80 82 82 83 85 863
2 7 9 1 7 9 7
1 811 82 82 85 85
2 3 9 3 9
1 88 887 911 92
3 1 9
1 87 88 90 91 937
3 7 3 7 9
1 94 94 95 97 97 98
4 1 7 3 1 7 3
1 96 99 99 1009
14
4 7 1 7
Theorem: They twin numbers prime, place oneself before and after even number divisible
by 3, when sum of their ciphers of units equal 4, 10 or 16.
11 + 12/3 + 13 17 + 18/3 + 19 29 + 30/3 + 31 2087 + 2088/3 + 2089

1+ 3=4 7 + 9 = 16 9 + 1 = 10 7 + 9 = 16
15
Only primes, which even components are even, create the not only that is to say, of twin
number e.g. 5 and 7, 11 and 13, form n and n + 2, but once even number ”triplets”: 3, 5, 7,
form n and n + 2 and n + 4, in which this even components are even : -1 -3 -5 =
2
It exist also one peer of successive prime 2 and 3 which are not "twins” yet only "successive”.
12 24 36 60 84
n+( n+2 )
/ \ / \ / \ / \ / \ pd = 12
5+ 7 11 + 13 17 + 19 29 +31 41 + 43
16
All natural numbers congruent to me according to module n’ – n ¿ 0 mod 6.

17
Crossing through prism light, it appears as rainbow of colors. Goes out with unity of number
natural put on shape six waves about length 6. Congruent to me according to module 6
numbers they divide on three groups of even numbers and odd / 2, 4, 6 / 3 -2- 5 -2- 7 /
keeping among me solid space 2 and 6 in every group 2/8, 3/9, 4/10, 5/11, 6/12, 7/13.
18
19
From first ten numbers prime rise for them four characteristic the number of unity
n n+2 n+6 n+8

k+1 k + 3 k + 7 k + 9
11 13 17 19
and they step out in tens which number after deduction 1 is divisible by 3 e.g. 10-1 = 9:
Every almost prime numbers we can introduce as sum of 2 and 3 keeping definite proportions.
In almost prime numbers, which are multiplicity of number 5 the relation of 2 to 3 amount 11
because 5 = 3 + 2
25 = 3 + 3 + 3 + 3 + 3 + 2 + 2 + 2 + 2 + 2
25 = 5(2) + 5(3) 5(5) „p“ = n(2 )+n(3) 55 = 11(2) + 11(3) 5(11)

65 = 13(2) + 13(3) 5(13) 85 = 17(2) + 17(3) 5(17)
95 = 19(2) + 19(3) 5(19) 115 = 23(2) + 23(3) 5(23)
125 = 25(2) + 25(3) 5(25) 145 = 29(2) + 29(3) 5(29)
155 = 31(2) + 31(3) 5(31) 175 = 35(2) + 35(3) 5(35)
185 = 37(2) + 37(3) 5(37) 205 = 41(2) + 41(3) 5(41)
625 = 125(2) + 125(3) 5(5)(25) 875 = 175(2) + 175(3) 5(7)(25)
because 7 = 2(2) +3
35 = 3 + 3 + 3 + 3 + 3 + 2 + 2 + 2 + 2 + 2 + 2 + 2 + 2 + 2 + 2
35 = 10(2) + 5(3) 7(5) „p“ = 2 n(2)+n(3 ) 49 = 14(2) + 7(3) 7(7)

77 = 22(2) + 11(3) 7(11) 91 = 26(2) + 13(3) 7(13)
20
119 = 34(2) + 17(3) 7(17) 133 = 38(2) + 19(3) 7(19)

161 = 46(2) + 23(3) 7(23) 203 = 58(2) + 29(3) 7(29)
2401 = 686(2) + 343(3) 7(7)(49) 2695 = 770(2) + 385(3) 7(7)(55)
In almost prime numbers, which are multiplicity of number 11 the relation of 2 to 3 amount
4 1 because 11 = 4(2) + 3
121 = 44(2) + 11(3) 11(11) „p“ = 4 n(2)+n(3 ) 143 = 52(2) + 13(3) 11(13)
275 = 100(2) + 25(3) 11(25) 385 =140(2) + 35(3) 11(35)
5 1 because 13 = 5(2) + 3
169 = 65(2) + 13(3) 13(13) „p“ = 5 n(2)+n (3) 221 = 85(2) + 17(3) 13(17)
637 = 245(2) + 49(3) 13(49) 715 = 275(2) + 55(3) 13(55)
7 1 because 17 = 7(2) + 3
289 = 119(2) + 17(3) 17(17) „p“ = 7 n(2)+n(3) 323 = 133(2) + 19(3) 17(19)
1105 = 455(2) + 65(3) 17(65) 1309 = 539(2) + 77(3) 17(77)
8 1 because 19 = 8(2) + 3
361 = 152(2) + 19(3) 19(19) „p“ = 8 n(2 )+n(3) 437 = 184(2) + 23(3) 19(23)
10 1 because 23 = 10(2) + 3
529 = 230(2) + 23(3) 23(23) „p” = 10n(2) + n(3) 575 = 250(2) + 25(3) 23(25)
13 1 because 29 = 13(2) + 3
841 = 377(2) + 29(3) 29(29) „p” = 13n(2) + n(3) 899 = 403(2) + 31(3) 29(31)
841 = 754 + 87 899 = 806 + 93
14 1 because 31 = 14(2) + 3
because 7 = 2(2) +3
961 = 434(2) + 31(3) 31(31) „p” = 14n(2) + n(3) 1147 = 518(2) + 37(3) 31(37)
961 = 868 + 93 1147 = 1036 + 111
17 1 because 37 = 17(2) + 3
1369 = 629(2) + 37(3) 37(37) „p”= 17n(2) + n(3) 25271 = 11611(2) + 683(3) 37(683)
21
1369 = 1258 + 111 25271 = 23222 + 2049
It the whole infinite set of natural numbers consists with infinite quantity of 2 and 3, which
are "units” of all numbers.
ÎN¥ = ¥(2) + ¥(3) = ¥(1)
2+1
Proof ¿ N¥ = ¿ ¥ 1 = ¿ ¥ 3
Alone meanwhile "units” they are even and odd multiplicity "unity” 1(2), 1(3), 1=
2+1
3 In this way was proved indirectly the basic theorem of algebraically theory of
numbers, that all numbers descend from one, because they consist from "units”.
Only plurality can to get unite, and primes as only they possess this ability, because they are
indivisible.
Why a number is prime? Because could be written as two smaller numbers multiplied
together. That is, it is not possible to represent a prime as the product of two integers a x b
with a, b > 1. Let q and r be the quotient and remainder of the division of n by d. That is, for
each n and d, let n = d q + r, where r and q are positive integers and 0 ≤ r < d.
Because all prime numbers contain in me one 3, it was not possible divide here by two.
Superiority meanwhile 2 it causes, that they don´t divide by three also. So they are indivisible
by all different numbers, and on this depends the complete primality certificate! p = n(2) + 3
2 = 1(2) + 0 3 = 0(2) + 3 5=2+3 7 = 2(2) + 3 11 = 4(2) + 3 13 = 5(2) + 3
17 = 7(2) + 3 19 = 8(2) + 3 23 = 10(2) + 3 233 = 115(2) + 3 251 = 124(2) + 3
p=
p±1
3
+2 [ ]
p±1
3
±1
e.g. 179 =
179+1
3
+2
3[
179+1
−1 ]
p = [ 2(k) – 2] + 3 727 = [ 2(363) – 2] + 3 = (726 – 2) + 3
127
2 −1 = 170 141 183 460 469 231 731 687 303 715 884 105 727
3
170 141 183 460 469 231 731 687 303 715 884 105 724
34 279 974 696 877 740 253 374 607 431 768 211 457
3
34 279 974 696 877 740 253 374 607 431 768 211 454
The natural numbers in scheme of 2 and 3.
If p ≥ 2 and p’ ≠ 0, are whole numbers not having common divisor, than such arithmetical
sequence contains in me all natural numbers.
2, 3, n(2), 2 + 3, n(3), 3 + n(2), n(2), n(3), n(2), ... n(2) + n(3)
2, 3, 4, 5, 6, 7, 8, 9, 10, .... 10 + 15 = 25
22
P(n) = p, p’, n(p), p + p’, n(p’), p’+ n(p), .... n(p) + n(p’),
n(2) + n(3) = N
2 2
3 3
2(2) 4
2 3 5
2(3) 6
2(2) 3 7
4(2) 8
3(3) 9
5(2) 10
4(2) 3 11
4(3) 12
5(2) 3 13
7(2) 14
5(3) 15
8(2) 16
7(2) 3 17
6(3) 18
8(2) 3 19
10(2) 20
7(3) 21
11(2) 22
10(2) 3 23
8(3) 24
5(2) 5(3) 25
13(2) 26
9(3) 27
14(2) 28
13(20 3 29
10(3) 30
14(2) 3 31
16(2) 32
11(3) 33
17(2) 34
7(2) 7(3) 35
12(3) 36
17(2) 3 37
19(2) 38
13(3) 39
20(2) 40
19(2) 3 41
14(3) 42
20(2) 3 43
22(2) 44
15(3) 45
23(2) 46
23
And here how with two primes 2 and 3 come into being all natural numbers.
1
2 2
3 3
4 2
5 3 2
6 2
7 3 4
8 2
9 3 6
10 2
11 3 8
12 2
13 3 10
14 2
15 3 12
16 2
17 3 14
18 2
19 3 16
20 2
21 3 18
22 2
23 3 20
24 2
25 3 22
26 2
27 3 24
28 2
29 3 26
30 2
31 3 28
32 2
33 3 30
34 2
35 3 32
24
The scheme of natural numbers
And so harmoniously develop natural numbers in support about principle "larger about one”
on the base of 2 and 3 in 360 ° the circle.
The proprieties of natural numbers repeat oneself periodically, what six numbers according to
pattern of primes.
Proof: 1 + 2 + 3 = 6̄ p + 6̄ = p’ n + 6̄ = n’ „p’“ – „p”= 6̄
25
With discovery of regularity in sequence of primes, that what 6 numbers repeat oneself the
same proprieties, was decoded together pattern how be distributed primes and the basing on
him periodicity of natural numbers.
2+1
1= 3
Two first numbers / 1 + 2 / added to me and divided by third next number / 3 /, it equals / 1 /
that is to say, again the same first number from three taking part in this working. Three first
next numbers added to me give perfect and triangular number 6, defining length of period in
what will repeat oneself the same proprieties in whole sequence of natural numbers.
Tres faciunt collegium, then it means three numbers they decide about whole scheme of
natural numbers. It 2 (3) = 6, was can introduce all numbers from here, as the sum of the
ones (+ 1), the twos (+ 2) and the threes (+ 3). The periodical scheme of natural numbers is so
perfect, as perfect is first perfect number 6, him untouched basis.
1+2+3=6=2·3
Ranked according to propriety natural numbers create 6 groups. Propriety of numbers in four
central groups repeat oneself in turn periodically, what 6 numbers. Primes create here two the
rows the complementary to two rows of group sixth the almost prime numbers.
Periodical scheme of natural numbers.
n1 n 2 n 3 n 4 n 5 n 6
2
3 4
5 6
7 8 9 10
11 12
13 14 15 16
17 18
26
19 20 21 22
23 24 26 25
27 28
29 30
31 32 33 34
36 35
37 38 39 40
41 42
43 44 45 46
47 48 50 49
51 52
53 54 56 55
57 58
59 60
61 62 36 64
66 65
67 68 69 70
71 72
73 74 75 76
78 77
79 80 81 82
83 84 86 85
87 88
89 90
91 92 93 94
96 95
97 98 99 100
101 102
103 104 105 106
107 108
109 110 111 112
113 114 116 115
117 118 119
120 122 121
123 124
126 125
Sieve of Eratosthenes.
In the six- wide rectangular array, the consecutive multiples of each number higher than three
lay on a straight line from zero to that number and beyond, and on periodic parallels to that
line further “down” if we begin writing the numbers from the “top” of the array.
In six groups of numbers we have 3 group of even numbers (II, IV, VI), and 3 odd (I, III, V).
Her multiplicities for prime number 5 on left have lain cascade, until after number almost
prime 25 = 5(5).
Next multiplicities for prime number 7 on right have lain her cascade, among which we have
second almost prime number 35 = 7(5). Parallel line by her runs factor 5 falling on left in pit,
until to fourth almost prime number 55 = 5(11).
The parallel line factor 7 falls from the multiplicity number 7(7) = 49 in right, until to lying in
V group of almost prime number 77 = 7(11).
Parallel line factor 5 falling on left in pit it crosses out their 13(5) = 65 and 15(5) = 85
multiplicity.
27
In this way they the parallel lines factors 5 and 7 cross out all almost prime numbers in I and
V the group of numbers.
So of the sieve Eratosthenes is situated less than 100 numbers 25 primes.
2 3 5 7 9 11
13 15 17 19 21 23
25 27 29 31 33 35
37 39 41 43 45 47
49 51 53 55 57 59
61 63 65 67 69 71
73 75 77 79 81 83
85 87 89 91 93 95
97 99
I II III IV V VI
28
All natural numbers congruent to me according to module.

n’ – n ¿ 0 mod. 6
(2n - 1) p = 2n + 3 2n = p(n) p = 2n + 3
2n = p – 3 =p(n) 2n = p – 3 "p"= n(2)+n(3) = p±1 "p"= n(2)+n(3)
5-3=2 3 7-3=4 2 +3 = 5 3(2) = 6 2(2) + 3 = 7
11 - 3 = 8 3(3) = 9 13 - 3 = 10 2(4) + 3 = 11 3(4) = 12 2(5) + 3 = 13
17 -3 = 14 3(5) = 15 19 - 3 = 16 2(7) + 3 = 17 3(6) = 18 2(8) + 3 = 19
23 - 3 = 23 3(7) = 21 22 2(10)+3 = 23 3(8) = 24 5(2 + 3) = 25
29 - 3 = 26 25 + 2 = 27 31 - 3 = 28 2(13)+3 = 29 3(10) = 30 2(14)+3 = 31
32 35 - 2 = 33 34 7(2 + 3) = 35 3(12) = 36 37
41 - 3 =38 3(13) = 39 43 - 3 = 40 41 3(14) = 42 43
47 - 3 = 44 3(15) = 45 46 47 48 14(2)+7(3)=49
53 - 3 = 50 49 + 2 = 51 52 53 54 11(2 + 3) = 55
59 - 3 = 56 55 + 2 = 57 61 - 3 = 58 59 60 61
62 65 - 2 = 63 64 13(2 + 3) = 65 66 67
29
68 3(23) = 69 70 71 72 73
22(2)+11(3)=7
74 75 + 2 = 77 76 7 78 79
80 3(27) = 81 82 83 84 17(2 + 3) = 85
26(2)+13(3)=9
86 85 + 2 = 87 88 89 90 1
92 95-2=91+2 94 19(2 + 3) = 95 96 97
98 3(33) = 99 100 101 102 103
Object 130
2n - 1 = 6n - 3 9 = 6(2) - 3 15 = 6(3) - 3 21 = 6(4) - 3 27 = 6(5) - 3 33 = 6(6) -

3 39 = 6(7) - 3 45 = 6(8) - 3 2n = 6n - 4 2 = 6(1) - 4 8 = 6(2) - 4 14 = 6(3) - 4 20 =
6(4) - 4 26 = 6(5) - 4 32 = 6( 6)- 4 38 = 6(7) - 4 p = 6n - 7 5 = 6(2) - 7 11 = 6(3) - 7
17 = 6(4) - 7 23 = 6(5) - 7 29 = 6(6) - 7 p = 6n - 5 7 = 6(2) - 5 13 = 6(3) - 5
2n = 6n - 6 6 = 6(2) - 6 12 = 6(3) - 6 18 = 6(4) - 6 24 = 6(5) - 6 30 = 6(6) - 6 36 = 6(7) - 6
42 = 6(8) - 6
2n = 6n - 8 4 = 6(2) - 8 10 = 6(3) - 8 16 = 6(4) - 8 22 = 6(5) - 8 28 = 6(6) - 8
34 = 6(7) - 8 40 = 6(8) - 8
And all runs according to pattern of prime numbers which seems, that they be scattered how
savagely growing weeds among natural numbers, but only there where they create fertile soil
giving the infinite quantity of natural numbers.
From first ten prime numbers can possess four characteristic ends: - 1, - 3, - 7, - 9, resulting
with rhythm 2/4 in what 11 +(2), 13 +(4), 17 + (2), 19 step out and they repeat oneself what
21 places in tens divisible by 3.
30
Table of tens in which prime numbers step out.
I II III IV V VI VII VIII IX X XI XII XIII XIV ..

|E – 1 | - 1 : 3 | : 3 | - 1 : 3 | : 3 | - 1 : 3 | - 1 : 3 | : 3 | -1 : 3 | : 3 | - 1 : 3 |: 3 | -1 : 3 | : 3 | - 1 : 3 |
| | 1 | 3| 4 | 6 | 7 | 10 | | 13 |15 | | 18 | 19 | 21 | |
| | | 24 | 25 | 27 | 28 | 31 | 33 | | | | | 40 | 42 | 43 |
| 21x2 | | | 46 | | 49 | 52 | 54 | | 57 | | 60 | | 63 | 64 |
| | | 66 | 67 | 69 | 70 | 73 | 75 | 76 | | | 81 | 82 | | |
| | | | 88 | | 91 | 94 | | 97 | 99 | |102| 103 |105 | 106 |
| E- 7 | - 1 : 3 | : 3 | - 1 : 3 | : 3 | : 3 |- 1 : 3 | : 3 |- 1 : 3 | : 3 | - 1 : 3 | : 3 | - 1 : 3 | : 3 | - 1 : 3 |
| | 1 | 3| 4 | 6 | 9 | 10 | 12 | 13 | 15 | 16 | | 19 | | 22 |
| | | | 25 | 27 | 30 | 31 | 33 | 34 | 36 | | 39 | | | |
| 21x2| | 45 | 46 | 48 | | | 54 | 55 | 57 | 58 | 60 | 61 | 63 | 64 |
| | | | 67 | | 72 | | 75 | | 78 | 79 | | 82 | | .
| | | 87 | 88 | 90 | 93 | 94 | 96 | 97 | | | | | | |
. I II III IV V VI VII VIII IX X XI XII XIII XIV XV .

|E- 3 | - 1 : 3 |+1: 3|-1 : 3|+1: 3|-1 : 3 |+1: 3|-1: 3|+1: 3|-1: 3|+1: 3|-1: 3|+1: 3|-1: 3|+1:3 |- 1: 3 |
| | 1 | 2 | 4 | 5 | 7 | 8 | 10 | 11 | | | 16 | 17 | 19| | 22 |
| | | 23 | 25 | 26 | 28 | 29 | 31 | | | 35 | 37 | 38 | | | 43 |
|21x3 | | 44 | 46 | | | 50 | 52 | | | 56 | | 59 | 61| | 64 |
| | | 65 | 67 | 68 | | | 73 | 74 | | 77 | | | 82| | 85 |
| | | 86 | 88 | | 91 | | | 95 | | 98 | | 101| 103| | 106 |
|E- 9 | - 1 : 3 |+1: 3 |-1 : 3|+1:3 |-1 : 3 |+1:3 |-1: 3|+1: 3|-1: 3|+1: 3|-1: 3|+1: 3|-1: 3|+1:3 |- 1: 3 |
| | 1 | 2 | | 5 | 7 | 8 | 10 | | 13 | 14 | | 17 | 19 | 20 | 22 |
| | | 23 | | 26 | | | | | 34 | 35 | 37 | 38 | 40 | 41 | 43 |
|21x3| | 44 | | 47 | 49 | 50 | | | | 56 | | 59 | 61 | | |
| | | 65 | | | 70 | 71 | 73 | | 76 | | | 80 | 82 | 83 | |
| | | | | | 91 | 92 | | | | | 100 | 101| 103| 104 | 106 |
The table of tens in which step out prime numbers betrays us sure regularity what it reigns in
sequence of prime numbers. Not accidentally has written down in this table of ending of
prime numbers in this way 1 - 7 = 6 = 3 - 9. This shows that the regularity what 6 numbers
from what can step out prime numbers, crosses over on the whole sequence the natural
numbers, which of propriety what they 6 numbers repeat oneself in six groups.
Primes with ending 1 - 7 create XIV ranks, in which their endings repeat oneself what 21 and
42 place, and with ending 3 - 9 create XV ranks, in which their endings repeat oneself what
21, 42 or 63 places and they in both cases are then divisible numbers by 7, which will be
further great meaning.
Prime, even and odd numbers they create "twelve segmental cycles”.
5 + 7 = 12 = 2 + 4 + 6 = 12 = 3 + 9
Periodical scheme of prime numbers results with principle the "twelve of segmental cycles” in
360 numbers which be comprises 30. Multiply thirty by unitary length of period (7) primes in
what step out 30 · 7 = 210 - receive decimal length of period of prime numbers.
p '−1 p−1 p ''+1 p '+1

− =210= −
3 3 3 3
31
11 - 3931 and 17 - 4217
+
1/ -1/ + - + + + - + - + - +
3 3 1/3 1/3 1/3 1/3 - 1/3 1/3 1/3 1/3 1/3 1/3 1/3 1/3
11 31 41 61 71 101 131 151 181 191 211
241 251 271 281 311 331 401 421 431
461 491 521 541 571 601 631 641
661 671 691 701 731 751 761 811 821
103
881 911 941 971 991 1021 1 1051 1061
120
1091 1151 1181 1 1231
132 145
1291 1301 1 1361 1381 1 1471 1481
153 162
1511 1 1571 1601 1
174 183 187
1721 1 1801 1811 1 1861 1 1901
195 208
1931 1 2011 1 2111
216 225
2131 2141 1 2221 1 2281 2311
237
2341 2351 1 2381 2411 2441 2521 2531
267
2551 2591 2621 1 2711 2731 2741
279
1 2801 2851 2861
300
2971 1 3011 3041 3061 3121
330
3181 3191 3221 3251 3271 1 3331 3361 3371
3391 3461 3491 3511 3541 3571 3581
363 376
1 3671 3691 3701 1
393
3821 3851 3881 3911 1
17 37 47 67 97 107 127 137 157 167 197 227
257 277 307 317 337 347 367 397
457 467 487 547 557 577 587 607 617 637 647
677 727 757 787 797 827
877 887 907 937 947 967 977 997
1087 1097 1117 1187 1217 1237 1277
132
1297 1307 7 1367 1427 1447 1487
162 166
1567 1597 1607 7 1637 1657 7 1697
174 187
7 1777 1787 1847 1867 7 1907
208
1987 1997 2017 2027 7
2137 2207 2237 2267 2287 229
32
7
237 246
2347 2357 7 2417 2437 2447 7 2477
267 270
2557 2617 2647 2657 7 2687 7
279 288 291
2767 2777 7 2837 2857 7 2897 7 2927 2957
3037 3067 3137 3167
321 340
3187 7 3257 7 3347
351 354
3407 3457 3467 7 3527 7 3557
363
3607 3617 7 3677 3697 3797
384 396
7 3877 3907 3917 3947 7 4007
405 417
4027 7 4127 4157 7 4217
13 - 3793 and 19 - 4409
+1 - + - +1 - +1 -
+1/3 -1/3 +1/3 -1/3 +1/3 -1 : 3 1:3 1:3 1:3 :3 1:3 :3 1:3
13 23 43 53 73 83 103 113 163 173 193 223

233 253 263 283 293 313 353 373 383 433
443 463 503 523 563 593 613 643
653 673 683 733 743 773 823 853
101 103 106
863 883 913 953 983 3 3 3
109 110 115 116 121 122
3 3 1123 3 3 1193 3 3
128 130 137 142 143 145 148
3 3 3 3 3 3 3
149 152 158 166 169
3 3 1543 1553 3 1613 3 3
172 173 178 187
3 3 1753 3 1823 3
191 193 199 200 205 206 208 211
3 3 1973 3 3 3 3 3 3
214 220 221 227 229
3 3 3 2243 3 3
233 242 247 250
3 2383 2393 3 3 3
254 263 268 269 271
3 2593 3 2663 3 3 3
275 283 284 290 295
3 2803 3 3 3 3
33
296 316
3 3023 3083 3
325 331 332 334 337
3 3 3 3 3
341 346 353 358
3 3433 3 3 3
359 361 362 367 373 379
3 3 3 3643 3 3 3
19 29 59 79 89 109 139 149 179 199 209 229
239 269 349 359 379 389 409 419 439
449 479 499 509 569 599 619
659 709 719 739 769 809 829 839
100 101 103 104 106
919 929 9 9 9 9 9
110 122 124 125 127
9 1129 9 9 9 9
128 131 139 142 143 145 148
9 9 9 9 9 9 9
149 157 160 166 169
9 1549 1559 9 9 1619 9 9
170 178 187 188
9 1759 9 9 9
194 199 202 206 208 209
9 1979 9 9 2039 9 9 9
212 223 226 230
9 2179 9 9 9
233 253
9 2389 2399 2459 9
254 257 265 268 269 271 272 274
9 9 2609 9 9 9 9 9 9
278 290 293
9 2819 2879 9 9
296 299 304 307 310 311 316
9 9 3019 9 9 3089 9 9 9
320 325 331 332 335
9 3229 9 3299 9 9 9
338 346 349 352 353 355
9 9 9 9 9 9
370 373 376 377
3659 9 3719 9 9 9
388 391 398
9 9 3929 9
401 404 409 412 415 421
9 9 4079 9 9 4139 9 9
422 425 433 440
9 9 4289 9 4349 9
Spiral twelve segmental cycles of primes.
2 + 3 = 5 + 7 = 12 + 11 + 13 = 3(12)
2 3
5 7 11 13
17 19 23
34
29 31 37
41 43 47
53 59 61
67 71 73
79 83
89 97
101 103 107 109
113
127 131
137 139
149 151 157
163 167
173 179 181
191 193
197 199
211
223 227 229
233 239 241
251
257 263
269 271 277
281 283
293
307 311 313
Spiral scheme of natural numbers.

35
With spiral arrangement of primes and almost prime result spiral arrangement of all natural
numbers, what we see in following table.
1 2 3 4
5 6 7 8 9 10 11
12 13 14 15 16 17 18
19 20 21 22 23 24 25
26 27 28 29 30 31 32
33 34 35 36 37 38 39
40 41 42 43 44 45 46
47 48 49 50 51 52 53
54 55 56 57 58 59 60
61 62 63 64 65 66 67
68 69 70 71 72 73 74
75 76 77 78 79 80 81
82 83 84 85 86 87 88
89 90 91 92 93 94 95
96 97 98 99 100 101 102
103 104 105 106 107 108 109
110 111 112 113 114 115 116
117 118 119 120 121 122 123
124 125 126 127 128 129 130
131 132 133 134 135 136 137
138 139 140 141 142 143 144
145 146 147 148 149 150 151
152 153 154 155 156 157 158
159 160 161 162 163 164 165
166 167 168 169 170 171 172
173 174 175 176 177 178 179
180 181 182 183 184 185 186
187 188 189 190 191 192 193
The spiral sequence of natural numbers / primes and almost prime /.

36
Spiral of primes.
Spiral of almost prime.

37
It is true in spirals primes and almost prime congruent according to different modules,
however difference between them is common module all natural numbers 23 -17 = mod 6,
what show above mentioned graphs. Module 40 = 17 + 23 arranges natural numbers in
infinite spiral.
Congruence according to module 6 shine numbers with all colors of rainbow.

38
The cross of numbers is bases on number 6, appointed by primes 2 and 3, which squeeze out
his brand on whole scheme of natural numbers.
39
It comes from structures of cross of natural numbers from congruence of primes and almost
prime according to module 2(2)2.
40
Sequence of primes and almost prime in five groups about the same endings are possible the
thanks their congruence according to module 5.
41
So looks clocks of primes measuring it in rhythm 2/4 (6).
According to this rhythm of primes flow away us days in four times year.
42
Binary and Ternary Goldbach's Conjecture, equation Pythagoras and great Fermat's
theorem.
Creative process in mathematics begins from conjecture. Mathematical conjecture really then
it becomes theorem, when we have on his truth irrefutable proof.
Theorem: Even numbers are "larger about 1” from one's odd, prime or almost prime
predecessor, and so they are duplication different natural number.
Proof: (2n – 1) ±1 \
„p” ±1 = 2n
p ±1 /
(2n – 1) + 1 = 2n 1 + (2n – 1) = 2n = 3p - p = p + p’
7 – 5 ¿ mod 2 ¿ 5 – 3 p’- p = n/2 ⇒ p’ + p = 2n 6–4 ¿ mod 2
¿ 10 – 8
3(2) – 2 = 4 3(3) – 3 = 6 3 + 5 = 8 3(5) – 5 = 10 5 + 7 = 12 3(7) – 7 = 14 11 + 5 = 16
This theorem proves the just truth Binary Goldbach's Conjecture, that every even larger
number than 2 is the sum two primes. Both even numbers how and primes congruent to me
according to modules 2, that is to say differences between them divisible they are by 2. From
here simple conclusion, if differences this and sum two primes divisible they are by 2, as even
numbers.
43
It will permit then us on formulating polynomial describing the solution of Binary Goldbach’s
Conjecture.
P(2n) = (p + p’) (2+2) (3 + 3) (3 + 5) (5 + 5) (5 + 7) (7 + 7) (5 + 11) (5 + 13) (7 + 13) (5 + 17)

44
Theorem: Every odd number larger than 5, is sum three primes, because difference among
odd and even number is always 3.
Proof: 2n = p + p (2n – 1) – (p + p) = p ⇒ 2n – 1 = p + p + p”
4=2+2 7 - (2 + 2) = 3 7 =2+2+3
45
Fermat’s last theorem.
Theorem: Difference among two successive square numbers always odd number, and square
number too is.
a(a) – b(b) = (a – b)(a + b) = c(c) 25 – 16 = 5(5) – 4(4) = (5 - 4)(5 + 4) = 3(3)
3(3) + 4(4) = 5(5)
46
Next numbers from infinite file of odd numbers added to square minuend create always
square subtrahend.
n n n
That is to say, that equation x + y =z from great theorem Fermat’s, only near n = 2
has
solution, because when add only odd number to square, we receive next square number.
1 and 3 are not square numbers, and above mentioned theorem despite this and on them
checks because primes are the multiplicity of number one and only me also. p = 1(p)
2² - 1² = (2 – 1)(2 + 1) = 1(3) 1(1) + 1(3) = 2(2)
In other words, equation for n > 2 in infinite file of natural numbers does not possess no
solution, because only the square numbers create the ternary Pythagoras.
2 2 2 2
z −x = y 25 – 9 = 16 ( y )≃0 mod 2
16 : 2 = 8 Rest 0
2 2 2
x x’ −x x
1 + 1 1
+ 3
2 4
+ 5
3 9
+ 7
4 16
+ 9
5 = 24 25
2
2 ! = 24
2 2 2
2 ! + 1 = 5 3+5+7+9 + 1 = 25
First ternary Pythagoras comes into being, when the sum of differences among successive
2
square numbers reaches value of faculty 2 !.
It number 2 modulates so formation so square numbers how and ternary Pythagoras, that is to
say that differences among odd numbers and squares in ternary Pythagoras they are divisible
by 2, therefore squares how and ternary Pythagoras are product 2 factors.
3(3) + 4(4) = 5(5) [2(5) – 1] + 2(8) = 2(13) – 1 3[2(2) – 1] + 2(2)2(2) = 5[2(3) – 1]
1 + 3 = 4 + 5 = 9 + 7 = 16 + 9 = 25 + 11 = 36 + 13 = 49 + 15 = 64 + 17 = 81 + 19 = 100 + 21..
\ 2 /\ 2 /\ 2 /\ 2 /\ 2 /\ 2 /\ 2 /\ 2 /\ 2 /\ 2 /
25 – 9 = 2(8) 169 – 25 = 2(72) 289 – 225 = 2(32) 625 – 49 = 2(288) 841 – 441 = 2(200)
It because 2 is the solid value of differences among two the successive odd numbers becomes
she the modules of differences with them square numbers in ternary Pythagoras, where with
difference among horizontal the and vertical length the side of triangle square creates, being
simultaneously the proof on truth of equation the Pythagoras and the Fermat's conjecture.
47
xy
z
2
=4 ( )
2
+ ( x−z )2
z
2
= 2xy + x
2
- 2xy + y
2
z
2
=x
2
+y
2
If the product of hypotenuse to be equal to sum two products of legs and product of their
difference, that is to say, that the square of hypotenuse is the sum of squares of legs.
Theorem: Difference among every odd square in triples Pythagoras even square is, which
2
congruent according to modules y ≃mod 2
2 2 2 2
Proof: z −x = y
25 – 9 = 16 ( y )≃0 mod 2
16 : 2 = 8 Rest 0
[2(5) – 1] + 2(8) = 2(13) – 1
2 2
The congruence the even square y ≃0 mod 2 signifies, that in quadrate of hypotenuse(z
) 4 triangles of the same hypotenuse be comprise (z), replenished about quadrate came into
being with differences between horizontal and vertical length the sides 4 triangles. e.g.
yx
2 2 2 2 2
y +x =z y–x=n 4 2 +n =z
2 2 2 2
e.g. 4 +3 =5 4–3=1 4(6) + 1 = 25
2 2 2 2
12 +5 = 13 12 – 5 = 7 4(30) + 7 = 169
2 2 2 2
8 + 15 = 17 15 – 8 = 7 4(60) + 7 = 289
2 2 2 2
24 +7 = 25 24 – 7 = 17 4(84) + 17 = 625
2 2 2 2
20 + 21 = 29 21 – 20 = 1 4(210) + 1 = 841
2 2 2 2
12 + 35 = 37 35 – 12 = 23 4(210) + 23 = 1369
2 2 2 2
40 +9 = 41 40 – 9 = 31 4(180) + 31 = 1681
2 2 2 2
28 + 45 = 53 45 – 28 = 17 4(630) + 17 = 2809
48
2 2 2 2
60 + 11 = 61 60 – 11 = 49 4(330) + 49 = 3721
2 2 2 2
56 + 33 = 65 56 – 33 = 23 4(928) + 23 = 4225
2 2 2 2
84 + 13 = 85 84 – 13 = 71 4(546) + 71 = 7225
2 2 2 2
72 + 65 = 97 72 – 65 = 7 4(2340) + 7 = 9409
2 2 2 2
144 + 17 = 145 144 – 17 = 127 4(1224) + 127 =21025
2 2 2 2
180 + 19 = 181 180 – 19 = 161 4(1710) + 161 = 37261
Ternary Pythagoras this square equation, and how there are all quadratic functions as graph of
function is a parabola. The running by vertex axis of symmetry be shifted in them about 2 in
2
direction on line - x, and about (y – x) in direction on line - y.
49
Number 2 in every semi stabile elliptic curve over rational numbers modular is.
(1+3+5+7+9)25 + (11+13+15+17+19+21+23+25)144 = 169 = 49(1+3+5+7+9+11+13) +

\2/\2/\2/\2/ \2/ \2/ \2/ \2/ \2/ \2/ \2/ 120(15 +17+19+21+23+25)
50
Theorem: The square of hypotenuse is equal the sum of squares of legs,

when it is sum of such quantity of odd numbers how degree of square hypotenuse.
2 2 2
Proof: x(2n – 1) = x y(2n ) = y z(2n – 1) = z x+y=z y=z–x x +(z –
x) = z
2 2 2 2 2
⇒ x + y = z ⇒ z = z(2n – 1) z - z(2n – 1) = 0
3[2(2) – 1] + 2(2)2(2) = 5[2(3) – 1]
1 + 3 + 5 = 9 = 3(3) 1 + 3 + 5 + 7 = 16 = 4(4) 1 + 3 + 5 + 7 + 9 = 25 = 5(5)
(1 + 3 + 5) + (1 + 3 + 5 + 7) = (1 + 3 + 5 + 7 +9) Σ(2n - 1) = n(a + z)/2 = n(n)
3(1 +5)/2 = 3(3) 4(1 + 7)/2 = 4(4) 5(1 + 9)/2 = 5(5) 3(3) + 4(4) = 5(5) 9 + 16 = 25
1 + 3 +
1 + 3 5
1 + + +
3 + + 5 + = 7 +
1 2
5 = 9 7 = 6 9 = 5
Theorem:
51
If the square of every natural number n, is the sum of consecutive odd numbers, it cannot be
decomposed into the sum of powers greater than 2, because in this case the difference of the
squares must be a number square.
Proof: n² = Σ n (2n – 1) 2² = 1 + 3 3² = 1 + 3 + 5 4² = 1 + 3 + 5 + 7 5² = 1 + 3 + 5 + 7 + 9
then 5² = (1 + 3 + 5) + (7 + 9) = 25 = 9 + 16
j^ + a^ = n^ j^ = a^ - n^ = (a + n)(n – a) = j(j) → j² = 1(a + n) j² = n² - a² → j² + a² = n²
If the product of sum and difference it is the square number, then she is divisible by number
which is square, as square difference two squares.
3 = √ 4+ 5 3² = 4 + 5 → 3² + 4² = 5² = 25 = 9 + 16
5 = √ 12+13 5² = 12 + 13 → 5² + 12² = 13² = 169 = 25 + 144
7 = √ 24+25 7² = 24 + 25 → 7² + 24² = 25² = 625 = 49 + 576
9 = √ 40+ 41 9² = 40 + 41 → 9² + 40² = 41² = 1681 = 81 + 1600
11 = √ 60+61 11² = 60 + 61 → 11² + 60² = 61² = 3721 = 121 + 3600
13 = √ 84+85 13² = 84 + 85 → 13² + 84² = 85² = 7225 = 169 + 7056
Can be to decompose on the sum squares these odd numbers, which as last term of a sum
have squares odd numbers e.g. 9, 25, 49, 81, as well as all the squares of tenth power. e.g.
10², 20², 30², 40²,..
6² + 8² = 10² 12² + 16² = 20² 18² + 24² = 30² 24² + 32² = 40²
13² = (1 + 3 + 5 + 7 + 9 + 11 + 13 + 15 + 17 + 19 + 21 + 23) + (25) = 169 = 25 + 144
25² = 625 = 49 + 576

(1+3+5+7+9+11+13+15+17+19+21+23+25+27+29+31+33+35+37+39+41+43+45+47)+(49)
1 + 3 = 4 + 5 = 9 + 7 = 16 + 9 = 25 + 11 = (36) + 13 = 49 + 15 = (64) + 17 = 81 + 19 = 100 +

21 = 121 + 23 = (144) + 25 = (169) + (27 + 29 + 31) = (256) + (33 + 35) = 324 + (37 + 39) =
(400) + (41 + 43 + 45 + 47) = 576 + (49) = (625) + (51 + 53 + 55 + 57 + 59) = 900
52
Object 251
Object 253
53
Object 255
Because the square of hypotenuse is sum of such quantity of successive odd numbers, as
degree of square of hypotenuse, equation Pythagoras was can write as fraction:
( x ) 2 ( y ) 2 ( z )2
+ =
( z ) 2 ( z )2 ( z )2
The common square denominator confirmed that the square of hypotenuse is the sum of the
squares of legs.
Object 258
54
n n
= (z − y
n
(z – y)(z + y) = x ) n=2
z x
2 2 2
(z – y)(z + y) = x
25 (5 – 4)(4 + 5) = 9 9
169 (13 – 12)(12 + 13) = 25
289 (17 – 15)(17 + 15) = 64
625 (25 – 24)(25 + 24) = 49
841 (29 – 21)(29 + 21) = 400
1369 (37 – 35)(37 + 35) = 144
1681 (41 – 40)(41 + 40) = 81
2809 (53 – 45)(53 + 45) = 784
3721 (61 – 60)(61 + 60) = 121
4225 (65 – 33)(65 + 33) = 3136
4225 (65 – 63)(65 + 63) = 256
5329 (73 – 55)(73 + 55) = 2304
7225 (85 – 77)(85 + 77) = 1296
7225 (85 – 84)(85 + 84) = 169
7921 (89 – 39)(89 + 39) = 6400
9409 (97 – 65)(97 + 65) = 5184
10201 (101–99)(101 +99)= 400
11881 (109-91)(109+91) = 3600
12769 (113-112)(113+112) = 225
15625 (125-117)(125+117) = 1936
18769 (137-105)(137+105) = 7744
21025 (145-143)(145+143) = 576
21025 (145-144)(145+144) = 289
22201 (149-51)(149+51) = 19600
30² - 24² = (30 – 24)(30 + 24) = 18²
Object 265
55
If Pythagorean threes come into being, when shorter leg is the square root of sum of
hypotenuse and longer leg and such threes have not common divisor then they come into
being also, when equation this we multiply about any total number L.
x = √ y+ z → x² = y + z → x² + y² = z²
3 = √ 4+ 5 → 3² = 4 + 5 → 3² + 4² = 5²
L(x) = √ L( Ly+ Lz) → (Lx)² = L(Ly + Lz) → (Lx)²/L + (Ly)²/L =
(Lz)²/L
2(3) = √ 2[2 ( 4 ) +2 ( 5 ) ] → [2(3)]² = 2[2(4) + 2(5)] → 6²/2 + 8²/2 = 10²/2
3(3) = √ 3 [3 ( 4 ) +3 ( 5 ) ] → [3(3)]² = 3[3(4) + 3(5)] → 9²/3 + 12²/3 = 15²/3
Triple (j, a, n) is a Pythagorean triple if and only if it is a [Lj, La, Ln], for any positive integer
L. Primitive Pythagorean triple is called, if j, a and n have no common divisor. e.g. (3, 4, 5),
(5, 12, 13). Thus, each Pythagorean triples can be obtained by dividing the original by the
greatest common divisor; and any Pythagorean three can be obtained from the original by
multiplying all three elements of the corresponding same number of positive integer.
From here the conclusion, that exist infinitely many primitive Pythagorean threes, so much
how many natural numbers, and any Pythagorean threes, so much how many products
infinitely many primitive Pythagorean threes of multiplied by infinitely many integer.
j(j) + a(a) = n(n) [L(j)]² + [L(a)]² = [L(n)]²
n(n) (n - a)(n +a) j(j)

10(10 (10 - 8)(10 + 8) 6(6)
17(17) (17 - 15)(17 + 15) 8(8)
26(26) (26 - 24)(26 + 24) 10(10)
20(20) (20 - 16)(20 + 16) 12(12)
50(50) (50 - 48)(50 + 48) 14(14)
34(34) (34 - 30)(34 + 30) 16(16)
30(30) (30 - 24)(30 + 24) 18(18)
56
52(52) (52 - 48)(52 + 48) 20(20)

122(122) (122 - 120)(122 + 120) 22(22)
Also prime numbers except 2 can introduce as product of difference and sum two natural
numbers and they are then prime difference two square numbers.
Object 277
2² - 1² = (2 – 1)(2 + 1) = 1(3) 1(1) + 1(3) = 2(2)
3 = (2 – 1)(2 + 1) 5 = (3 – 2)(3 + 2) 7 = (4 – 3)(4 + 3) 11 = (6 – 5)(6 + 5)
13 = (7 – 6)(7 + 6) 17 = (9 – 8)(9 + 8) 19 = (10 – 9)(19 + 9) 23 = (12 – 11)(12 + 11).
p +1 2 p+1 2
[ ] −[ p− ] =(a−b )(a+b )
2 2 3 =
p=
3+1 2 3+1 2
[ ] −[3− ] =(2−1)(2+1)
2 2
5+1 2 5+1 2
[ ] −[5− ] =(3−2)(3+2 )
2 2
5= 7=
7+1 2 7+1 2
[ ] −[7− ] =(4−3 )(4+3)
2 2
This is Great Fermat's theorem for all values of n proved, because he is for all odd prime
values of n valid.
57
Looking closer at the following graph, you will see that half of the following sums of two
primes on a straight line parallel to the y - axis with real part ½ y lie. This means that the
linear Diophantine equation ax + by - c = 0, with given integer pairs not have common divisor
Coefficient a, b, c, always in prime x, y is solvable.
1(2) + 1(3) – 5 = 0 1(3) + 1(7) – 10 = 0 1(5) + 1(13) – 18 = 0 1(11) + 1(19) – 30 = 0
Object 283
Natural numbers, divisibility and primes.
Central notion within of natural numbers concerns divisibility, and more far order of primes -
natural number larger than 1, which has not natural divisor, that is to say, no different divisor
except 1 or me alone. Sequence of primes has begun since 2, 3, 5, 7, 11, 13, 17, 19, 23,…
Already Euclid proved before over 2 000 years, that this sequence does not end, and so there
is no the largest prime. Beyond 2 all primes are odd with characteristic endings - 1 - 7 - 3 - 9.
From second side is in force the main theorem of arithmetic: every natural number will give
oneself unambiguously to introduce as product of primes. Primes gain by this on meaning for
mathematics, as contribution to construction of all different numbers. The every number,
which is not prime, will give oneself with these indivisible factors to to put together.
Prime numbers 2 and 3 are components of all natural numbers really. Why, for example, can’t
all numbers be built simply by multiplying and adding together different combinations of the
primes 2 and 3. e.g. 4 = 2(2),
5 = 2 + 3, 6 = 3 + 3, 7 = 2(2) + 3, 8 = 2(2)2, 9 = 3(3), 10 = 2(2) + 3 + 3, 11 = 2(2)2 + 3,
12 = 3(3)+ 3, 13 = 2(2)+ 3(3), 14 = 2(2)2 + 3 + 3, 15 = 3(3)+ 3 + 3, 16 = 2(2)2(2),
17 =2(2)2+3(3), 18 =2(2)2(2)+2, 19 =2(2)2(2)+3, 20 =2(2)2(2)+2(2), 21 =2(2)2(2)+2+3
22 = 2(2)2(2)+ 3 + 3, 23 = 2(2)2(2)+ 2(2)+ 3, 24 = 2(2)2(2)+ 2(2)2, 25 = 2(2)2(2)+ 3(3),
26 =2(2)2(2)+2(2)2+2, 27 =3(3)3, 28 =2(2)2(2)+3+3(3), 29 =2+3(3)3, 30 =3+3(3)3.
58
All prime be built according to simple formula: p = n(2)+3, 5 =2+3, 7 =2(2)+3 11 =4(2)+3,
13 = 5(2) + 3, 17 = 7(2) + 3, 19 = 8(2) + 3, 23 = 10(2) + 3, 29 = 13(2) + 3. Formula
this permits us to divide primes on two classes: they class of basic primes (2, 3, 5, 7), which
alone for me are the building material and these, which are already the multiplicity of number
7. e.g.11 = 7+(4) 13 = 7+(6) 17 = 2(7)+(3) 19 = 2(7)+(5) 23 = 3(7) + (2) 29 = 4(7) + (1)
And so we write new formula: p = n(7) + The rest (1,2,3,4,5,6)
Object 285
It was can sequence of primes and write so: 2, 3, 5,-2- 7,-4- 11,-2- 13,-4- 17,-2- 19,-4- 23. In
spaces among numbers notice hidden formula: - 2 - 4 - 2 - 4. These two last formulae, they
will play further decisive part.
Are there formulas that produce some of the prime? Here you are! p = n(2) + 3
2 = 1(2) + 0 3 = 0(2) + 3 5 = 1(2) + 3 7 = 2(2) + 3 11 = 4(2) + 3 13 = 5(2) + 3
17 = 7(2) + 3 19 = 8(2) + 3 23 = 10(2) + 3 13(2) + 3 = 29 14(2) + 3 =31 233 = 115(2) + 3
251 = 124(2) + 3.
Irrefutable proof.
Mathematicians knew, however, that proving the Riemann Hypothesis would be of far greater
significance for the future of mathematics than knowing that Fermat’s equation has no
solutions when n is bigger than 2. The Riemann Hypothesis seeks to understand the most
fundamental objects in mathematics – prime numbers.
The primes are those indivisible numbers that cannot be written as two smaller numbers
multiplied together. The primes are the jewels studded throughout the vast expanse of the
infinite universe of numbers that mathematicians have explored down the centuries.
Their importance to mathematics comes from their power to build all other numbers. Every
number that is not a prime can be constructed by multiplying together these prime building
59
blocks /2 and 3/. Mastering these building blocks offers the mathematician the hope of
discovering new ways of charting a course through the vast complexities of the mathematical
world.
Yet despite their apparent simplicity and principal character, prime numbers remain the most
mysterious objects studied by mathematicians. They question about distribution of primes
belonged to the most difficult. They were the long time then the question of plain theoretical
nature, however today found primes in different realms the use.
Suddenly the economic interest appears also the question, or proof the Riemann's hypothesis
cans you something say about distribution of primes in world of numbers. If centuries of
searching had failed to unearth some unknowing formula which would generate the list of
prime numbers, perhaps it was time to adopt a different strategy. Look through a list of prime
numbers, and you’ll find that it’s impossible to predict when the next prime will appear. The
list seems chaotic, random, and offers no clues as to how to determine the next number. Can
you find a formula that generates the numbers in this list, some unknowing rule that will tell
you what the 10 000 000th prime number is?
Not the question about quantity of primes in given interval of numbers, but the observation of
spaces between two primes, she directed me on sure regularity from what they appear. 2, 3, 5,-
2- 7,-4- 11,-2- 13,-4- 17,-2- 19,-4- 23 and so 2, 4, 2, 4, then the smallest space is among two
primes and the decisive structure, recognizable in whole does not end sequence of primes. It
after 23 number first 29 comes however in space 6 (23,- 2 -25,-4-29), because place between
them is for first product of primes, number almost prime 25 = 5(5). Since then all almost
prime numbers, as product of primes will take free place in sequence of primes, keeping
spaces - 2 - 4 - 2 - 4. Generations have sat listening to the rhythm of the prime number drum
as it beats out its sequence of numbers: two beats, followed by three beats, five, seven, eleven.
As the beat goes on, it becomes easy to believe that random white noise, without any inner
logic, is responsible. At the centre of mathematics, the pursuit of order, mathematicians could
only hear the sound of chaos.
I do realize, that prime and almost prime numbers appear in interval two and fourth. If it
walks about finding formulae and order, then primes are not more unequalled challenge.
Knowing in what space sequent prime or relatively prime will appear, we can easily whole
their list take down. And when we to this have yet the hand, as to qualify in sequence the
sequent number, or it is prime or almost prime numbers, then and list of primes does not
appear us as chaotic and accidental. The List of primes is, the heartbeat of mathematics, but a
pulse wired regular in rhythm by multiplicity of seven in two – by – four steps.
Fractions are the numbers whose decimal expansions have a repeating pattern. For example
1/7 = 0,142 857 142 857
At bases of distribution of primes in sequence of numbers, lies decomposition of their

products on prime factors. According to Fermat small theorem numbers to power ( p - 1)
minus one, they are divisible without the rest by prime. e.g. 106 - 1 = 999 999/7 = ↓
- 142 857
857 142
Proof:
60
( a p−1−1 ) 6 6
≅ 0 mod p if a ≠ p p≥3 a≥2 2 = 64 – 1 = 63/7 3 = 729 –
p
1 = 728/7
Similarly by fractions: 1/7 = 0,142 857 142 857 1 …

2/7 = 0,2857 142 857 14 …
3/7 = 0,42857 142 857 1 …
4/7 = 0,57 142857 142857 1..
5/7 = 0,7 142587 142587 1..
6/7 = 0,857 142587 142587..
8/7 = 1,142 857 142857
9/7 = 1,2857 142 857 14..
10/7 = 1,42857 142 857 …
11/7 = 1,57 142 857 1428 …
12/7 = 1,7 142 857 14285 …
13/7 = 1,857 142 857 142 …
where the quotient in decimal expansion from some place after comma begins repeating in
infinity six - digits numbers since 1, and finishing on 7. In practice this marks that every the
the six - digit combination of numbers e.g. (x x x x x x)/ 7, (x y x y x y)/ 7, (y x y x y x)/ 7,
(xyz xyz)/ 7, (zxy zxy)/ 7, (yzx yzx)/ 7, (zyx zyx)/ 7, (yxz yxz)/ 7, (xzy xzy)/ 7, and their
multiplicities divide without the rest by 7.
111 111 111 111 111 111 / 7 = 15 873 015 873 015 873
0 1 2 3 4 5 6 7
1 2 3 4 5 6 7 8
2 3 4 5 6 7 8 9
3 4 5 6 7 8 9 0
4 5 6 7 8 9 0 1
5 6 7 8 9 0 1 2
6 7 8 9 0 1 2 3
7 8 9 0 1 2 3 4
This gets from here, that all numbers 0, 1, 2, 3, 4, 5, 6, 7, 8, 9,.. they are congruent to me
according to module 7, as this shows following radar graph
61
Object 295
If difference among given number a, and prime is divisible by prime, then given number be
a− p 187−17
=V p =10
complex. p e.g. 17
Only difference among two primes divisible it is by 7, because p - (2,3,5,11,13,29) = n(7), and
all primes be distributed according to multiplicity of number 7 (23 - 2)/ 7 = 3 (17 - 3)/ 7 = 2
(19 - 5)/ 7 = 2 (53 - 11)/ 7 = 6 (41 - 13)/ 7 = 4 (43 - 29)/ 7 = 2
Primes and almost prime follow after me in rhythm on two fourth.
1. 3. + 2 = 5.- 2 – 7 – 4 – 11 – 2 – 13 – 4 – 17- 2 – 19 – 4 – 23 - 2 – 25 – 4 – 29 – 2 – 31 -
Theorem:
If difference between odd numbers, the cannot be written as product of two smaller numbers a
and b with a, b> 1, divide without rest by 7, then a and b are prim and congruent modulo 7.
Proof: a – b = n(p) then a ≡ b (mod p)

62
p ¿ p`mod p 11 ¿ 53 mod 7 when 11 =1(7)+ 4 and 53 = 7(7)+ 4 then p and

p`
congruent according to mod p, and difference p`- p is multiplicity p. 53 - 11 = 42/7 = 6
This proof gives mathematics to instruction very quick procedure on qualification of primes
about any quantity of places. p - (2,3,5,11,13,29) = n7
p = n(7) + R(1,2,3,4,5,6)
0 1 2 3 4 5 6
7 11 13
17 19
23 25
29 31
35 37 41
43 47
49 53 55
59 61
65 67
71 73
77 79 83
85 89
91 95 97
101 103
107 109
Discovery of rhythm 113 115 beating the heart of
mathematics storm 119 121 125 the safety of system the
RSA, any business 127 131 selling prime numbers
could realistically in 133 137 139 support about this proof
peddle their wares 143 145 under the banner
“satisfaction 149 151 guaranteed or your
money back”, without 155 157 too much fear of going
bust. And so it turns 161 163 167
out, that it 64 numerical
factor with 129 numerical code is not
169 173
number prime, because divisible it is by
175 176 177 178 179 180 181
7.
3 490 529 510 847 650 949 147 844 619 903 898 133 417 764 638 493 387 843 990820577:7
= 498 647 072 978 235 849 878 263 517 129 128 304 773 966 376 927 626 834 855 831 511
But second 65 numerical factor is prime (32769132993 266 709 549 961 988 190 834 461413
177 642 967 992 942 539 798 288 533 – 5):7 = 4 681 304 713 323 815 649994569741547780
201 882 520 423 998 991 791 399 755 504
Prime numbers are numbers that are divisible only by one and themselves. They are the atoms
of arithmetic, for any number is either a prime or a product of primes. The first few primes are
63
2, 3, 5, 7, 11, 13, 17, 19, but despite their simple definition the prime numbers appear to be
scattered randomly amid the integers.
There is simple way to tell if a number is prime – than they cannot be written as product of
two smaller numbers a and b, with a, b>1, and that is the basis for most modern encryption
schemes.
Solving the Riemann Hypothesis could lead to new encryption schemes and possibly provide
tools that would make existing schemes, which depend on the properties of prime numbers,
more vulnerable.
Object 304
64
Primes do not possess except 1 and only number no factors, but number almost prime are
almost so good, because they have at most two factors prime, or one prime and almost prime,
or two almost prime e.g. 187 = 11(17) 343 = 7(49) 78 337 = 133(589). 23 is prime, but 25 =
5(5) it is almost prime. So alone numbers 35(5·7), 49(7·7), 55(5·11), 65(5·13), 77(7· 11),
85(5 · 17)
65
Number almost prime built with prime numbers larger than three, they develop how splendid
fan in infinity.
Sequences of numbers almost prime.
(10)(20)
25
35 (14)(28)
49
55
65
77
85
95 91
115 119 (22)(44)

125 121
133
145 143
155 (52)(26)
161 169
175
185 187
205 203 209

215 217
221
235
245 247
259 253
265
275 (34)(68)
287 289
66
295 299
305 301
319
325 329 323
335
343 341
355 (76)(38)
365 361
371 377
385
395 391
407 403
415 413
425 427
437
445
455 451
469
475 473
485 481
497 493
505
515 511 517 (46)(92)
527 529
In interval what 30 numbers (10-40) on three numbers with ending 5 (15, 25, 35), two of them
are almost prime. Primes and almost prime follow after me in interval what 2(p) and 4(p).
25 – 2(5) – 35 – 4(5) – 55 49 – 4(7) – 77 – 2(7) – 91 121 – 2(11) - 143 – 4(11) – 187
17 - 4(5) – 37 – 2(5) – 47 – 4(5) – 67- 2(5) – 77 – 4(5) – 97 – 2(5) – 107 – 4(5) – 127 – 2(5).
.
Triangle of almost prime
.
5 7 11 13 17 19 23 25 29 31 35 37 41 43 47 49 53 55 59
12 14 15
5 25 35 55 65 85 95 115 5 5 5 175 185 205 215 235 245 265 275 295
13 16 17 20 21
7 49 77 91 119 3 1 5 3 7 245 259 287 301 329 343 371 385 413
12 14 18 20 25 27 31 34
11 -22 -44 1 3 7 9 3 5 9 1 385 407 451 473 517 539 583 605 649
1 16 22 24 29 32 37 40
3 -52 -26 9 1 7 9 5 7 3 455 481 533 559 611 637 689 715 767
1 28 32 39 42 49 52 100
7 -34 -68 9 3 1 5 3 7 595 629 697 731 799 833 901 935 3
1 36 43 47 55 58 100 104
9 -76 -38 1 7 5 1 9 665 703 779 817 893 931 7 5 1121
2 52 57 66 71 108 121 126 135
3 -46 -92 9 5 7 3 805 851 943 989 1 1127 9 5 7
2 10 62 72 77 102 107 122 132 137 147
5 0 -50 5 5 5 875 925 5 5 1175 5 5 5 5
2 84 89 101 107 124 236 142 153 159
9 -58 116 1 9 5 3 1189 7 3 1 7 5 1711
3 12 -62 96 108 1147 127 133 145 151 164 170 182
67
1 4 1 5 1 3 7 9 3 5 9
3 14 122 129 143 150 164 171 185 192 206
5 -70 0 5 5 5 5 5 5 5 5 5
3 14 136 151 159 173 181 196 203 218
7 8 -74 9 7 1 9 3 1 5 3
4 16 168 176 192 200 217 225 241
1 -82 4 1 3 7 9 3 5 9
4 17 184 202 210 227 236 253
3 2 -86 9 1 7 9 5 7
4 18 220 230 249 258 277
7 -94 8 9 3 1 5 3
4 19 240 259 269 289
9 6 -98 1 7 5 1
5 10 21 280 291 312
3 6 2 9 5 7
5 22 302 324
5 0 110 5 5
5 23 348
9 118 6 1
25 + 2(5) = 35 + 4(5) =55 + 2(5) = 65,… 49 + 4(7) = 77 + 2(7) = 91 + 4(7) = 119,..
25 35
55 65 49
85 95 77 91
115 125 121 119
145 155 133 143
175 185 169 161
205 215 203 187 209
235 245 221 217
265 275 289 253 247
295 305 319 287 301 299
68
325 335 323 329

355 365 361 343 341
385 395 377 391 371
415 425 407 403 413
445 455 437 451 427
475 485 481 473
505 515 497 511 493 517
535 545 527 533 539
565 575 553 551
595 605 601 583 581
625 635 623 611 629
655 665 649 637
685 695 679 671 667 689
715 725 707 721 703 713 697
745 755 737 731 749
775 785 767 781 763 779
805 815 799 793 803 791
835 845 841 833 817
865 875 871 851 847 869
895 905 889 901 893 899
925 935 917 931 913 923
955 965 949 961 943 959
985 995 979 973 989
101 102 100 100 100
5 5 7 3 1
104 105 103 104 102
5 5 7 3 7
107 108 106 108 107 105 107
5 5 7 1 3 7 9
109
1105 1115 9 1111
1135 1145 1127 1141 1133 1121 1139
1165 1175 1159 1157 1147 1169
120
1195 5 1189 1183 1177 1199
122 123 121 120
5 5 9 1211 7
125 126 124 126 124 125 124
5 5 7 1 3 3 1
128 129 127 127 126
5 5 3 1 7
131 132 130 131
5 5 9 3
134 135 133 133 135 133 134 133 134
5 5 9 7 1 3 3 1 9
137 138 136 136 135 137
5 5 9 3 7 9
140 141 139 139 140 139 138
5 5 7 1411 3 3 1 7
143 144 144 142 141
5 5 1 1 7
146 147 145 146 146
5 5 7 3 9
149 150 150 149 147
5 5 1 3 7
69
152 153 151 151 151 150 152

5 5 9 7 3 7 9
155 156 154 156 154 153
5 5 7 1 1 7
158 159 157 159 157 158
5 5 7 1 3 9
161 162 160
5 5 3
164 165 163 165 163 164 163 164
5 5 9 1 3 3 1 9
167 168 168 167 166 167
5 5 1 3 1 9
170 171 170 169 168
5 5 1711 3 1 7
173 174 172 172 171 173
5 5 9 7 7 9
176 177 175 177 175 176
5 5 7 1 1 9
179 180 179 178 179
5 5 3 1 9
5 7 11 13 17 19
5 29 23 25
37 31 35
7 43 47 41 49
59 53 55
67 61 65
11 79 73 71 77
89 83 85
1
3 97 95 91
10 10 10 10
9 3 7 1
1
7 113 115 119
12 12 12
11 7 5 1
1 13 13 13 13
9 9 7 1 3
1 14 14 14
3 9 5 3
15 15 15
7 1 5
1 2 16 16 16 16
3 3 3 7 1 9
17 17 17
9 3 5
1 18 18 18
7 1 5 7
19 19 19 19
9 3 7 1
1 2 20 20 20
70
9 9 5 3 9
3 21 21
1 211 5 7
1 22 22 22 22
7 9 3 7 1
23 23 23
9 3 5
1 24 24 24
9 1 5 7
2 3 25 25 25 25
3 7 7 1 9 3
26 26 26
9 3 5
27 27 27
7 1 5
1 4 28 28 28 28
7 1 3 1 7 9
2 29 29 29
3 3 5 9
4 30 30 30
3 7 5 1
2 31 31 31
9 3 7 311 9
1 4 32 32 32
9 7 5 9 3
33 33 33
7 1 5
3 4 34 34 34 34
1 9 9 7 3 1
35 35 35
9 3 5
1 36 36 36
9 7 5 1
2 5 37 37 37 37
9 3 9 3 1 7
38 38 38
9 3 5
2 39 39 39
3 7 5 1
3 3 40 40 40 40
1 7 9 1 7 3
5 41 41 41
9 9 5 3
6 42 42 42
1 1 5 7
2 43 43 43 43
3 9 3 1 7
44 44 44
9 3 5
4 45 45 45
1 7 5 1
6 46 46 46 46
7 3 7 1 9
4 47 47 47
3 9 5 3
71
3 48 48 48
7 7 5 1
2 7 49 49 49 49
9 1 9 1 7 3
50 50 50
9 3 5
4 7 51 51
7 3 5 511 7
Theorem:
If difference between odd numbers, the can be written as product of two primes, divide
without rest by 3, then the number are almost prime and congruent modulo 3.
Proof: a – b = n(3) then a ≡ b (mod 3)

"p" ¿ "p`" mod p 49 ¿ 85 mod 3 when 49 =16(3)+1 and 85=28(3)+1, then "p" and
"p`"
congruent according mod p, and difference "p`"-"p" is multiplicity p. 85 - 49 = 36/3 = 12
„p”- (5,7,11,13) = n(3)
Object 308
350 351 352 353 354 355 356 355 (76)(38)

357 358 359 360 361 362 363 36
1
364 365 366 367 368 369 370 365
371 372 373 374 375 376 377 377
378 379 380 381 382 383 384
72
385 386 387 388 389 390 391 391

392 393 394 395 396 397 398 395
399 400 401 402 403 404 405 403
406 407 408 409 410 411 412 407
413 414 415 416 417 418 419 415 413
420 421 422 423 424 425 426 425
427 428 429 430 431 432 433 427
434 435 436 437 438 439 440 43
7
441 442 443 444 445 446 447 445
448 449 450 451 452 453 454 451
455 456 457 458 459 460 461 455
462 463 464 465 466 467 468
469 470 471 472 473 474 475 475 473 469
476 477 478 479 480 481 482 481
483 484 485 486 487 488 489 485
490 491 492 493 494 495 496 493
497 498 499 500 501 502 503
504 505 506 507 508 509 510 505
511 512 513 514 515 516 517 515 517
518 519 520 521 522 523 524 (46)(92)
525 526 527 528 529 530 531 527 529
532 533 534 535 536 537 538 535 533
539 540 541 542 543 544 545 539
546 547 548 549 550 551 552
553 554 555 556 557 558 559
73
It will suffice only to look on table of primes and almost prime, to oneself about this to
convince, what order and rules reign here. This would border about absurdity, these just
fundamental elements of well ordered world of mathematics, if would they behave savagely
and unforeseeable.
2617 2615 2611

2621 2627 2623 2629
2633 2635 2639
2647 2645 2641
2659 2657 2651 2653
2663 2665 2669
Above mentioned table shows, that primes and almost prime ranked according to 4 basic
numbers unity 9 – 3 – 7 – 1, divide number almost prime about number unity 5 on two
complementary parts. Fact this is the denial so far general opinion, about irregularities of
occurrence of primes and them the alleged decreasing on further of up growth of sequence
numbers. Smaller or larger gaps among primes 2-4-6-8-14-18-20-22-24-26-30-34-36-44-52-
60-72-86-96-112-114-118-132-148-154-180-210-220-222-234-248-250-282-288-292-320-
336-354-382-384-394-456-464-468-474-486-490-500-514-516-532-534-540-582-588-602-
652-674-716-766-778-804-806-906,… be full with numbers almost prime, so as appearing
primes in interval 2 and 4.
Among primes 1327 and 1361 his place occupies 10 successive numbers divisible by primes,
that is almost primes.
1327 + 4 = 1331/11 + 2 = 1333/31 + 4 = 1337/7 + 2 = 1339/13 + 4 = 1343/17 + 2 = 1345/5 +

4 = 1349/19 + 2 = 1351/7 + 4 = 1355/5 + 2 = 1357/23 + 4 = 1361 – 1327 = 34
Similarly is among primes 8467 and 8501. Among 370261 and 370373 we have gap about
length 112. For p < N the largest at present well-known maximal gap equal m =1442, p =
804 212 830 686 677 669.
10 000 019+2 = 10 000 021/97+4 = 10 000 025/5+2 = 10 000 027/37+4 = 10 000 031/227 + 2
=10 000 033/397+4 = 10 000 037/43+2 = 10 000039/7+4 = 10 000 43/2089+2 = 10 000 045/5
+ 4=10000049/47+2 =10 000 051/73+4 =10 000 055/5+2=10 000 57/79+4= 10 000 061/19+2
=10 000 063/17+4 = 10 000 067/7+2 = 10 000 069/181+4 = 10 000 073/31+ 2 = 10 000 075/5
+ 4 = 10 000 079 – 10 000 019 = 60
2677 2671 2675

2689 2683 2687 2681
2699 2693 2695
2707 2705 2701
2719 2713 2711 2717
2729 2725 2723
2731 2735 2737
2749 2741 2747 2743
2753 2755 2759
2767 2765 2761
74
n p p n P P
2 3 5 292 1453168141 1453168433
4 7 11 320 2300942549 2300942869
6 23 29 336 3842610773 3842611109
8 89 97 354 4302407359 4302407713
14 113 127 382 10726904659 10726905041
18 523 541 384 20678048297 20678048681
20 887 907 394 22367084959 22367085353
22 1129 1151 456 25056082087 25056082543
30 13063 13093 464 42652618343 42652618807
34 1327 1361 468 127976334671 127976335139
36 9551 9587 474 182226896239 182226896713
44 11633 11677 486 241160624143 141160624629
52 19609 19661 490 297501075799 297501076289
60 100000019 100000079 500 303371455241 303371455741
72 31397 31469 514 304599508537 304599509051
86 155921 156007 516 416608695821 416608696337
96 360653 360749 532 461690510011 461690510543
112 370261 370373 534 614487453523 614487454057
114 492113 492227 540 738832927927 738832928467
118 1349533 1349651 582 1346294310749 1346294311331
132 1357201 1357333 588 1408695493609 1408695494197
148 2010733 2010881 602 1968188556461 1968188557063
154 4652353 4652507 652 2614941710599 2614941711251
180 17051707 17051887 674 7177162611713 7177162612387
210 20831323 20831533 716 13829048559701 13829048560417
220 47326693 47326913 766 19581334192423 19581334193189
222 122164747 122164969 778 42842283925351 42842283926129
189969589
234 189695659 3 804 90874329411493 90874329412297
248 191912783 191913031 806 171231342420521 171231342421327
250 387096133 387096383 906 218209405436543 218209405437449
282 436273009 436273291 1132 1693182318746371 1693182318747503

129426849 129426877 74956545755437129 74956545755437260
288 1 9 1308 9 7
Theorem about congruence odd number permits faultlessly to distinguish primes from another
divisible numbers, that is almost prime. e. g. prime confirms the legitimacy of formula:
p = 1 + n(7) p = 2 + n(7) p = 3 + n(7) p = 4 + n(7) p = 5 + n(7) p = 6 + n(7)

89
2 - 1 = 618 970 019 642 690 137 449 562 111
-3
618 970 019 642 690 137 449 562 108/7 = 88 424 288 520 384 305 344 937 444
75
(3 203 000 719 597 029 781 – 3) : 7 = 457 571 531 371 004 254
(810 433 818 265 726 529 159 – 5) : 7 = 115 776 259 752 246 647 022 and
almost prime with numerous iterations inside, as and in quotient of formula “p”= 2 + n(3)
7 · 20408163265306122449 = 142 857 142 857 142 857 143

- 2
142 857 142 857 142 857 141/3 = 476 190 476 190 476 190 47
We happen in second factor of following expression sure unusual prime:

31
10 + 1 = 11· 909 090 909 090 909 090 909 090 909 091 =
10 000 000 000 000 000 000 000 000 000 001
Decomposition on primes her product, it lies at bases of iteration in this number.

From this, that 1001 = 7 · 143 = 11 · 91 = 13 · 77 and 10 001 = 73 · 137 create following
iterations. Products:
7 · 1001 = 7007 11 · 1001 = 11011 13 · 1001 = 13013 77 · 1001 = 77077
91 · 1001 = 91091 143 · 1001 = 143143 73 · 1001 = 73073 137 · 1001 = 137137
and 999 multiplicity 1001 e.g. 323 · 1001 = 323 323 and number 10 001, 43 ·10001= 430043
29 · 430 043 = 124 7 124 7 3 · 12 471 247 = 37 41 37 41
We see noteworthy iterations in prime 9 090 909 091 and her square, and so number almost
prime 826 644 628 100 826 446 281 and prime 82 644 628 099 173 553 719, in which except
iteration see two peers of numbers in reflection mirror.
On radar graph number almost prime are visible on black background.

76
999990
9999907 1 9999905
9999913 9999911 9999917 9999919
999992
9 9999925 9999923
999993 999993
1 7 9999935
999994
3 9999949 9999947 9999941
9999955 9999959 9999953
9999961 9999965 9999967
999997 999997
3 1 9999977 9999979
9999985 9999983 9999989
9999991 9999997 9999995
1000000 1000000 1000000 1000000
3 1 7 9
1000001 1000001 1000001
9 5 3
1000002 1000002 1000002
1 5 7
1000003 1000003 1000003 1000003
9 7 1 3
1000004 1000004 1000004
5 3 9
1000005 1000005 1000005
1 5 7
1000006 1000006 1000006 1000006
9 7 1 3
1000007 1000007 1000007
9 3 5
1000008 1000008 1000008
5 1 7
1000009 1000009 1000009 1000009
7 1 9 3
Let’s apply so well-known us a formula to constructing successive primes and almost prime,
that could generate this kind of pattern.
(1,2,3,4,5,6) + n(7) = p 2 + 3(7) = 23 (1,2) + n(3) = „p“ 1 + 8(3) = 25
9 999 901 = 1 428 557(7) + 2 9 999 905 = 3 333 301(3) + 2

9 999 907 = 1 428 558(7) + 1 9 999 913 = 3 333 304(3) + 1
9 999 929 = 1 428 561(7) + 2 9 999 923 = 3 333 307(3) + 2
9 999 931 = 1 428 561(7) + 4 9 999 925 = 3 333 308(3) + 1
9 999 937 = 1 428 562(7) + 3 9 999 935 = 3 333 311(3) + 2
9 999 943 = 1 428 563(7) + 2 9 999 949 = 3 333 316(3) + 1
9 999 971 = 1 428 567(7) + 2 9 999 977 = 3 333 325(3) + 2
9 999 973 = 1 428 567(7) + 4 9 999 985 = 3 333 328(3) + 1
9 999 991 = 1 428 570(7) + 1 9 999 997 = 3 333 332(3) + 1
10 000 019 = 1 428 574(7) + 1 10 000 015 = 3 333 338(3) + 1
10 000 079 = 1 428 582(7) + 5 10 000 085 = 3 333 361(3) + 2
9999907 9999901 9999905

77
9999911 9999917 9999913 9999919

9999929 9999925 9999923
9999937 9999931 9999935
9999943 9999941 9999947 9999949
9999955 9999953 9999959
9999965 9999961 9999967
9999973 9999971 9999977 9999979
9999985 9999983 9999989
9999991 9999995 9999997
1000000
10000001 10000007 3 10000009
1000001 1000001 1000001
9 5 3
1000002
5 10000021 10000027
1000003
10000031 10000037 3 10000039
1000004 1000004
5 3 10000049
1000005
5 10000051 10000057
1000006
10000061 10000067 3 10000069
1000007 1000007 1000007
9 5 3
1000008
5 10000081 10000087
1000009
10000091 10000097 3 10000099
Here are the primes amongst the 100 numbers either side of 10 000 000. For example in the
100 numbers immediately before 10 000 000 since 9 999 901 to 9 999 991 there are 9 primes,
but look now at how few there are in the 100 numbers above 10 000 000: only 2 primes
since10 000 001 to 10 000 099.
78
Arithmetical sequence of primes and almost prime are sequence line and helical growing.
Helical sequence of primes and almost prime.
3 2
7 5
11 13
79
17 19
23 25
31 29
37 35
41 43
47 49
53 55
61 59
67 65
71 73
79 77
83 85
89 91
97 95
10 10
1 3
10 10
7 9
113 115
12
1 119
12 12
7 5
13 13
1 3
13 13
7 9
14 14
5 3
15 14
1 9
15 15
7 5
16 16
3 1
16 16
7 9
17 17
3 5
18 17
1 9
18 18
7 5
19 19
1 3
19 19
7 9
20 20
5 3
20
211 9
21 21
7 5
22 22
3 1
22 22
7 9
80
Theorem: Primes and almost primes create twin sequences, growing

evenly about absolute number 6.
The Helical structure of arithmetical twin sequence of primes and almost primes show among
two following terms constant difference, i.e. it exists such number d ¿ R possessing
property, which treat to all n ¿ N:
a n+1−an =d 11 – 5 = 6 = 13 – 7
2 + 3 = 5 (2) 7
11 13
17 19
23 25
29 31
35 37
41 43
47 49
Theorem: It sequence of primes and relatively primes is the twin sequence from
initial term p = 2 and constantly difference d = 6 (- 2 – 4).
Therefore though in Riemann’s conjecture function of location of primes π (x), is the gradual
function about high irregularity, as helical arithmetical twin sequence of primes and almost
primes, which the difference the d = 6 is constant, it shows the amazing smoothness.
81
From here sequence of prime numbers is not similar to accidental sequence of numbers, but to
well ordered structure. So basic numbers does not be definite per nature the method of
accidental throw with coin. Accident and chaos they are for mathematician simply cruelty.
Twin sequences of prime and almost prime numbers a congruent to me according to algebraic
module 72.
82
Distribution of primes and almost prime according to rules of congruence of modules 7 and 3
is the reason, why these folded with 2 and 3 numbers be place on straight line of line, which
confirms the legitimacy of the Riemann hypothesis. The uniformity from what rises the graph
of primes e.g.: by 100 000, he owes not quantity of primes to number N what can express
with logarithmic function, but proportionate distributing, resulting from congruence of
according to modules 7.
83
„Upon looking at these numbers, one has the feeling of being in the presence of the
inexplicable secrets of creation.” /D. Zagier/
Are the primes distributed chaotically or can we find some means for computing them?
Will it ever be possible to predict with arbitrary accuracy where the next one lies? Yes, here
you are! p + 6(7) = p’, or almost prime “p”
The prime numbers are distributed not chaotically. All prime and almost prime numbers to be
congruent modulo 7. Because the smallest gap between their equal 2 + 4 = 6, and 6(7) = 42
than is possible to predict with arbitrary accuracy that the next one lies what 42 gap.
Primes and almost prime can settle according to their quantity. Such in a row creates fourteen
the vertical groups and the innumerable amount of horizontal rows / periods / primes and
84
almost prime. Length period 42 = 7(6) it is product of length of period all natural numbers and
seven units about what grow primes and almost prime. In third and eighth group excepting
prime 7, have only almost prime numbers.
I II III IV V VI VII VIII IX X XI XII XIII XIV
5 7 11 13 17 19 23
25 29 31 35 37 41 43
47 49 53 55 59 61 65
67 71 73 77 79 83 85
89 91 95 97 101 103 107
109 113 115 119 121 125 127
131 133 137 139 143 145 149
151 155 157 161 163 167 169
173 175 179 181 185 187 191
193 197 199 203 205 209 211
215 217 221 223 227 229 233
235 239 241 245 247 251 253
257 259 263 265 269 271 275
277 281 283 287 289 293 295
299 301 305 307 311 313 317
319 323 325 329 331 335 337
341 343 347 349 353 355 359
Number 19, is prime in that case the sum 19 + 42 = 61 is prime too. Number 9 091, is prime
in that case the sum 9 091 + 42 = 9 133 is prime too. 9 091 – 19 = 9 072 : 42 = 216
Number 909 091, is prime in that case the sum 909 091 + 42 = 909 133 is prime too.
Number 909 090 909 090 909 090 909 090 909 091, is prime so I can predict with arbitrary
accuracy that the next one lies in gap 42 = 909 090 909 090 909 090 909 090 909 133 – 43 =
909 090 909 090 909 090 909 090 909 090 : 42 = 21 645 021 645 021 645 021 6 45 021 645
909 1, is prime + 42 = 9 133 too,
909 091, is prime + 42 = 909 133 too,
9 090 909 091 = 11 · 23 · 4093 · 8779
909 090 909 091 = 859 · 1 058 313 049
9 090 909 090 909 091 = 103 · 4013 · 21 993 833 369
909 090 909 090 909 091, is prime
9 090 909 090 909 090 909 091, is prime
909 090 909 090 909 090 909 091, is prime
9 090 909 090 909 090 909 090 909 091 = 59(154 083 204 930 662 557 781 201 849)
85
909 090 909 090 909 090 909 090 909 091, is prime too. They are 4,6,18, 22,24, and 30 digits
primes. One from 100 and 1000 million digits prime are 9.090909091e99 999 999
and 9.090909133e999 999 999.
8 264 462 809 917 355 371 900 826 446 281
They are 32 digits 90 909 090 909 090 909 090 909 090 909 091 is dividable by 11 and
e38“p“ = e26 + e10 + e2 105 831 304 899 989 415 869 510 001 058 313 049
38 digits numbers 90 909 090 909 090 909 090 909 090 909 090 909 091 : 859
e32 „p“ = e22 + e9 + e1 8 264 462 809 917 355 371 900 826 446 281
+ 82 644 628 099 173 553 719 008 264 462 81
90 909 090 909 090 909 090 909 090 909 091
e99 999 998 “p“ = e4 545 454(22) + e9 + e1 = 9.090909091e99 999 997
e1000 000 000 „p“ = e38 461 538(26) + e10 + e2 = 9.090909091e999 999 999
2 + 3 + 5 + 7 + 11,..+ 29 + 31 + 37 = 222 35 + 41 + 43 + 47 + 49,..+ 71 + 73 + 79 = 798
77 + 83 + 85,.. + 113 + 115 + 121 = 1386 119 + 125 + 127,.. + 155 + 157 + 163 = 1986
222 – 48(12) – 798 – 49(12) -1386 – 50(12) – 1986 ,.. 14n + [14n + n(12)],..
They in this way grow with 14 of primes and almost prime built-up terms, arrange in
exquisite mosaic illustrating their row in intervals 2 and 4 in arrangement of sevens.
There are two facts about the distribution of prime numbers of which I hope to convince you
so overwhelmingly that they will be permanently engraved in your hearts. The first is that,
86
despite their simple definition and role as the building blocks of the natural numbers, the
prime numbers same for me a balding blocks, that is to say every prime bigger than 3 the sum
their predecessor 2, 3, 5, 11, 13, and 29 is, and n-the multiplicity of prime 7. They grow not
like weeds among the natural numbers, seeming to obey no other law than that of chance, and
nobody can predict where the next one will sprout. The second fact is even more astonishing,
for it states just the opposite: that the prime numbers exhibit stunning regularity, that there are
laws governing their behavior, congruence laws modulo 7, and that they obey these laws with
military precision. To support the first of these claims, let me begin by showing you a list of
the prime up to 100. I hope you will agree that there is apparent reason why one number is
prime and another not.
2, 3, 2+3=5 5 + 6(7) = 47
5+2=7 11 + 6(7) = 53
2(2) + 7 = 11 3 + 8(7) = 59
2(3) + 7 = 13 5 + 8(7) = 61
3 + 2(7) = 17 11 + 8(7) = 67
5 + 2(7) = 19 29 + 6(7) = 71
2 + 3(7) = 23 3 + 10(7) = 73
1 + 4(7) = 29 2 + 11(7) = 79
3 + 4(7) = 31 13 + 10(7) = 83
2 + 5(7) = 37 5 + 12(7) = 89
13 + 4(7) = 41 13 + 12(7) = 97
29 + 2(7) = 43
I II III IV V VI VII VIII IX X XI XII XIII

2 3 5 7 4 6 8 9
11 13 10 12 14 15
17 19 16 18 20 21
23 25 22 24 26 27
31 29 28 30 32 33
37 35 34 36 38 39
41 43 40 42 44 45
47 49 46 48 50 51
53 55 52 54 56 57
59 61 58 60 62 63
67 65 64 66 68 69
73 71 70 72 74 75
79 77 76 78 80 81
83 85 82 84 86 87
89 91 88 90 92 93
97 95 94 96 98 99
101 103 100 102 104 105
107 109 106 108 110 111
113 115 112 114 116 117
121 119 118 120 122 123
127 125 124 126 128 129
87
The numbers 2 and 3 are building blocks all natural numbers. Even indivisible by 2 and 3
prime and almost prime numbers can you from n(2) and n(3) to put together e.g. 2 + 3 = 5
2(2) + 3 = 7 4(2) + 3 = 11 5(2) + 3 = 13 7(2) + 3 = 17 8(2) + 3 = 19 10(2) + 3 = 23
5(2) + 5(3) = 25 9(3) = 27
The periodical table of natural numbers distinguishes 13 groups of even and odd numbers. In
columns I - VII we have prime numbers appearing what n(7). e.g. 5 + 2(7) = 19 + 4(7) = 47 +
2(7) = 61 + 4(7) = 89 + 2(7) = 103 + 4(7) = 131 + 6(7) = 173 …
In VI column except 7 we have free places on stepping out what n(7) almost prime numbers.
e.g. 35 + 2(7) = 49 + 4(7) = 77 + 2(7) = 91 + 4(7) = 119 + 2(7) = 133 + 4(7) = 161 which are
in VIII and IX column.
25 + 2(5) = 35 + 4(5) = 55 + 2(5) = 65 + 4(5) = 85 + 2(5) = 95 + 4(5) = 115 + 2(5) = 125 …
121 + 2(11) = 143 + 4(11) = 187 + 2(11) = 209 + 4(11) = 253 + 2(11) = 275 + 4(11) = 319 …
In tenth and twelfth column we have even numbers, and in XI and XIII column even and odd
numbers divisible by 3, following what 2(3).
101, 1 001=11(91), 100 001=11(9091), 10 000 001=11(909 091), 1.000 001E+99 999 999
103, 1 003=17(59), 100 003, 1 000 003, 1.000 003E+12,+18,+19,+99 999 999,+999 999 999
107, 1 007=19(53), 100 007, 1 000 007, 1.000 007E+99 999 999, E+999 999 999
109, 1 009, 10 009, 100 009, 1 000 009, 1.000 009E+99 999 999, E+999 999 999
113, 1 013, 10 013, 100 013, 1 000 013, 1.000 013E+99 999 999, E+999 999 999
115, 1 015, 10 015, 100 015, 1 000 015, 1.000 015E+99 999 999, E+999 999 999
119, 1 019, 10 019, 100 019, 1 000 019, 1.000 019E+99 999 999, E+999 999 999
121, 1 021, 10 021, 100 021, 1 000 021, 1.000 021E+99 999 999, E+999 999 999
125, 1 025, 10 025, 100 025, 1 000 025, 1.000 025E+99 999 999, E+999 999 999
127, 1 027=13(79), 100 027, 1 000 027, 1.000 027E+99 999 999, E+999 999 999
131, 1 031, 10 031, 100 031, 1 000 031, 1.000 031E+99 999 999, E+999 999 999
133, 1 033, 10 033, 100 033, 1 000 033, 1.000 033E+99 999 999, E+999 999 999
137, 1 037=17(61), 10 037, 100 037, 1 000 037, 1.000 037E+14, E+16, E+99 999 999
139, 1 039, 10 039, 100 039, 1 000 039, 1.000 039E+13, E+99 999 999, E+999 999 999
2, 3, 5, 11, 13, 29 + n(7) = p
2 + 15(7) = 107 3 + 14(7) = 101 5 + 14(7) = 103
11 + 14(7) = 109 13 + 18(7) = 139 29 + 12(7) = 113

88
3 + 148(7) = 1 039 29 + 1430(7) = 10 039 5 + 142 862(7) = 1 000 039
5 + 142 857 142 862(7) = 1 000 000 000 039
5 + 142 857 142 862e99 999 999(7) = 1.000 000 039E+100 000 000
5 + 142 857 142 862e999 999 999(7) = 1.000 000 039E+1000 000 000
3 + 1(7) = 10
2 + 14(7) = 100
6 + 142(7) = 1 000
4 + 1 428(7) = 10 000
5 + 14 285(7) = 100 000
1 + 142 857(7) = 1,00E+06
3 + 1 428 571(7) = `1,00E+07
2 + 14 285 714(7) = 1,00E+08
6 + 142 857 142(7) = 1,00E+09
4 + 1 428 571 428(7) = 1,00E+10
5 + 14 285 714 285(7) = 1,00E+11
1 + 142 857 142 857(7) = 1,00E+12
3 + 1 428 571 428 571(7) = 1,00E+13
2 + 14 285 714 285 714(7) = 1,00E+14
6 + 142 857 142 857 142(7) = 1,00E+15
4 + 1 428 571 428 571 428(7) = 1,00E+16
5 + 14 285 714 285 714 285(7) = 1,00E+17
4 + 1,428 571 428e99(7) = 1,00E+100
4 + 1,428 571 428e999(7) = 1,00E+1000
4 + 1,428 571 428e99 999 999(7) = 1,00E+100 000 000
4 + 1,428 571 428e999 999 999(7) = 1,00E+1000 000 000
Factorization of almost primes in prime factors.
Factorise large numbers on factors prime, it was in last 2000 years difficult problem. Majority
mathematicians’ is opinion, that factorisation numbers is fundamental extraordinary
computational problem. One of main reasons, why the factorise numbers is so difficult; she
was alleged fortuity of occurrence of primes.
We know since, that primes and almost prime are present not accidentally, but according to
rules of congruence of modules 7 and 3, we have also the way on factorise their products.
It with theorems about congruence odd numbers results brightly, or number is prime or almost
prime, and we for help of binomial formula easily will take apart every odd number on factors
prime. We know, that difference among two successive square numbers state always odd
number, we have such number from here to write down in some way as difference two
squares and take out the common factor.
Difference of 2 squares:
a(a) – b(b) = (a – b)(a + b)
89
p is common to both terms. Put this common factor outside the brackets.
“p” = p(p) “p” = p(p + p`) 25 = 5(2 + 3)
„p“ = p(p´) = [(p + p‘)/2 – {(p + p‘)/2 – p}][(p + p‘)/2 + {(p + p‘)/2 – p}]
147 573 952 589 676 412 927 = 193 707 721(761 838 257 287) =
[(193 707 721 + 761 838 257 287)/2 – {(193 707 721 + 761 838 257 287)/2 – 193 707 721}]
[(193 707 721 + 761 838 257 287)/2 + {(193 707 721 + 761 838 257 287)/2 – 193 707 721}]
(381 015 982 505 – 380 822 274 783)( 381 015 982 505 + 380 822 274 783)
35 = 6(6) – 1(1) = (6 – 1)(6 + 1) = 5(7) 55 = 8(8) – 3(3) = (8 – 3)(8 + 3) = 5(11)
143 = 12(12)–1(1) = (12 – 1)(12+ 1) = 11(13) 221 = 15(15)-2(2) =(15-2)(15 + 2) = 13(17)
253 = 17(17)–6(6) = (17 – 6)(17+ 6) = 11(23) 247 = 16(16)-3(3) =(16-3)(16 + 3) = 13(19)

If the difference between one number a, and a prime number is divisible by a prime number,
then the number is complex.
a− p 287−7
=( p'−1 ) =40
p e. g. 7 p(p’) = (p’- 1)p + p 7(41) = (41 – 1)7 +
7
The straight is dividing by 3 given number and to subtract from her rounded quotient without
the rest. Then we level rounded quotient to the closest third multiplicity of prime numbers or
almost prime. About the same number we round off received previously the difference to n
-the multiplicity of the same prime numbers or almost prime. And so we receive prime factors
on what factorizing is number almost prime.
319 : 3 = 106 - 19 = 87 : 3 = 29 343 : 3 = 114 + 33 = 147 : 3 = 49
319 - 106 = 213 + 19 = 232 : 8 = 29 343 - 11 4 = 229 - 33 = 196 : 4 = 49
319 = 11(29) 343 = 7(49)
8051 : 3 = 2683 – 2392 = 291 : 3 = 97

8051 – 2683 = 5368 + 2392 = 7760 : 80 = 97
8051 = 83(97)
9 090 909 091 : 3 = 3 030 303 030 – 550 964 187 = 2 479 338 843 : 3 = 826 446 281
9090909091 – 3030303030 =6060606061 + 550964187 = 6611570248 : 8 = 826446281
9 090 909 091 = 11(826 446 281)
909 090 909 091 : 3 = 303 030 303 030 – 299 855 363 883 = 3174939147 : 3 = 1 058 313 049
909090909091 – 303030303030 = 606060606061 + 299855363883 = 905 915 969 944 : 856=
1 058 313 049 909 090 909 091 = 859(1 058 313 049)
9090909090909091 : 3 = 3030303030303030 – 2765519270373639 = 264783759929391 : 3=

88261253309797
9090909090909091 – 3030303030303030 = 6060606060606061 + 2 765 519 270 373 639 =
8 826 125 330 979 700 : 100
9 090 909 090 909 091 = 103(88 261 253 309 797)
90
9 090 909 090 909 090 909 090 909 091 : 3 = 3 030 303 030 303 030 303 030 303 030
- 2 568 053 415 511 042 629 686 697 483
462 249 614 791 987 673 343 605 547/3
= 154 083 204 930 662 557 781 201 849
9090909090909090909090909091
– 3030303030303030303030303030 = 6 060 606 060 606 060 606 060 606 061
+ 2 568 053 415 511 042 629 686 697 483
8 628 659 476 117 103 235 747 303 544 : 56
= 154 083 204 930 662 557 781 201 849
9 090 909 090 909 090 909 090 909 091 = 59(154 083 204 930 662 557 781 201 849)
8 051 = 90(90) – 7(7) = (90 – 7)(90 + 7) = 83(97) 493=23(23)-6(6)=(23-6)(23+6) = 17(29)
341 = 21(21)-10(10) = (21-10)(21+10) = 11(31) 391 = 20(20)-3(3) =(20-3)(20+3)= 17(23)
529 = 23(20+3) 497 = 17(68+3) 1105 = 17(62 + 3) 1309 = 17(74 + 3) 1147 = 31(34 + 3)
1369 = 37(34 + 3) 25271 = 37(680 + 3) 734 591 = 11(66778 + 3)
8453= 79(107) 11111 = 41(271) 120481 = 211(571) 526313=281(1873) 322577= 163(1979)
434779=197(2207) 353357=307(1151) 10 000 043=2089(4787) 10 000 127= 167(59881)
370 267 = 479(773) 370 283 = 379(977) 370 289 = 349(1061) 370 297 = 353(1049)
370 303 = 367(1009) 370 319 = 547(677) 370 327 = 107(3461) 370 339 = 199(1861)
370 351 = 179(2069) 370 361 = 383(967) 370 309 = 67(5527) 370 313 = 47(7879)
370 273 = 43(8611) 370 301 = 29(12769) 370 333 = 37(10009) 370 369 = 23(16103)
370 243 = 17(21779) 370 249 = 11(33659) 370 253 = 13(28481) 370 271 = 11(33661)
370 277 = 17(21781) 370 291 = 19(19489) 370 331 = 13(28487) 370 337 = 11(33667)
370 379 = 17(21787) 370 343 = 59(6277) 370 279 = 7(52897) 370 381 = 11(33671)
370 307 = 7(52901) 370 321 = 7(52903) 370 349 = 7(52907) 370 363 = 7(52909)
9 999 913 = 7(1428559) 9 999 917 = 23(434779) 9 999 941 = 7(1428563)
9 999 947 = 19(526313) 9 999 949 = 31(322579) 9 999 971 =13(769229)
10 000 001 = 11(909 091) 10 000 003 = 13(769 231) 10 000 007 = 941(10 627)
10 000 009 = 23(434 783) 10 000 013 = 421(23 753) 10 000 021 = 97(103 093)
10 000 027 = 37(270 271) 10 000 031 = 227(44 053) 10 000 037 = 43(232 559)
10 000 039 = 7(1 428 577) 10 000 033 = 397(25 189) 10 000 043 = 2 089(4 787)
91
10 000 049 = 47(212 767) 10 000 061 = 19(526 319) 10 000 067 = 7(1 428 581)
10 000 081 = 7(1 428 583) 10 000 091 = 251(39 841) 10 000 093 = 53(188 681)
10 000 097 = 17(588 241) 10 000 099 = 19(526 321) 10 000 111 = 11(909 101)
10 000 123 = 7(1 428 589) 10 000 127 = 167(59 881) 10 000 133 = 11(909 103)
10 000 129=89(112361) 10 000 171 = 271(36901) 10 000 187 = 41(243907)
4 294 967 297=6 700 417(638+3) 1000001=101(9901) 8 547 008 547(13) = 111 111 111 111
7 709 321 041 217 = 25 271(305 065 927)
7 709321041217=(152 545 599-152520 328)(152 545 599+152 520 328)=25271(305065927)
We have with same the also fast way on qualification of primes, necessary to construction of
code the RSA. She in end was found hidden behind primes and almost prime full secrets
structure, since ages in demand throughout mathematicians, and her music can write in
addition in infinity.
Who knows this basic interval two four, two four, knows also where what note will come with
prime or almost prime numbers. We cannot already more now tell about their fortuity, but
more about them timeless and universal character.
No perceptible order and Riemann’s Hypothesis.
Mathematicians since centuries listened intently in sound primes, and they heard unsettled
tones only. These numbers resemble accidentally spilled notes on mathematical notes paper,
without recognizable melody. Riemann sinusoidal waves what created right away zero Zeta
they - showed scenery hidden harmony.
Mathematicians despite all could with sure probability to estimate, how many prime numbers
is in given interval. Only four in first ten are (2, 3, 5 and 7). It in first hundred is them 25, in
first thousand 168 their part comes down from 40 by 25 on 16,8 percentage.
Among smaller numbers from billion, 5% is the only just. To describe this down come of
frequency of an occurrence in approximation the simple formula. From this however satisfied
mathematicians are not. They want to know how far real occurrence numbers first deviates
from counted frequency. Riemann in one's famous eight page paper “On the Number of
Prime Numbers less than a Given Quantity /"Über die Anzahl der Primzahlen unter einer
gegebenen Größe"/ he wrote: "The known approximating expression F( x) = Li(x) is therefore
1
2
valid up to quantities of the order x and gives somewhat too large a value; But also the
increase and decrease in the density of the primes from place to place that is dependent on the
periodic terms has already excited attention, without however any law governing this
behavior having been observed. In any future count it would be interesting to keep track of
the influence of the individual periodic terms in the expression for the density of the prime
numbers.” Real quantity of prime numbers differs from them counted frequency so alone
often, as eagle near repeated throw with coin will fall out tails. Differently saying that is
Riemann supposed, that occurrence prime numbers be subject to the rights of case. And he
92
made a mistake here, because prime numbers be subject to the rights of congruence of
according to module p’≡ p (mod.7).
He has written: “One now finds indeed approximately this number of real roots within these
limits, and it is very probable that all roots are real. Certainly one would wish for a stricter
proof here.”
Riemann Hipothesis.
Riemann zeta- function for s = 0,5 + i * t.
The Riemann hypothesis (also called the Riemann zeta-hypothesis), along with suitable
generalizations, is considered by many mathematicians to be the most important unresolved
problem in pure mathematics. First formulated by Bernhard Riemann in 1859, it has
withstood concentrated efforts from many outstanding mathematicians for 150 years (as of
2009).
The Riemann hypothesis (RH) is a conjecture about the distribution of the zeros of the
Riemann zeta-function ζ(s). The Riemann zeta-function is defined for all complex numbers s
≠ 1. It has zeros at the negative even integers (i.e. at s = −2, s = −4, s = −6, ...). These are
called the trivial zeros. The Riemann hypothesis is concerned with the non-trivial zeros, and
states that:
The real part of any non-trivial zero of the Riemann zeta function is ½.
Thus the non-trivial zeros should lie on the so-called critical line, ½ + it, where t is a real
number and i is the imaginary unit. The Riemann zeta-function along the critical line is
sometimes studied in terms of the Z-function, whose real zeros correspond to the zeros of the
zeta-function on the critical line.
The Riemann hypothesis implies a large body of other important results. Most mathematicians
believe the Riemann hypothesis to be true, A $1,000,000 prize has been offered by the Clay
Mathematics Institute for the first correct proof.
Unsolved problems in mathematics: Does every non-trivial zero of the Riemann zeta function
have real part ½?
Riemann mentioned the conjecture that became known as the Riemann hypothesis in his 1859
paper On the Number of Primes Less Than a Given Magnitude, but as it was not essential to
his central purpose in that paper, he did not attempt a proof. Riemann knew that the non-
93
trivial zeros of the zeta-function were symmetrically distributed about the line s = ½ + it, and
he knew that all of its non-trivial zeros must lie in the range 0 ≤ Re(s) ≤ 1.
In 1896, Hadamard and de la Vallée-Poussin independently proved that no zeros could lie on
the line Re(s) = 1. Together with the other properties of non-trivial zeros proved by Riemann,
this showed that all non-trivial zeros must lie in the interior of the critical strip 0 < Re(s) < 1.
This was a key step in the first proofs of the prime number theorem.
In 1900, Hilbert included the Riemann hypothesis in his famous list of 23 unsolved problems
— it is part of Problem 8 in Hilbert's list, along with the Goldbach conjecture. When asked
what he would do if awakened after having slept for five hundred years, Hilbert said his first
question would be whether the Riemann hypothesis had been proven (Derbyshire 2003:197).
The Riemann Hypothesis is one of the Clay Mathematics Institute Millennium Prize
Problems.
In 1914, Hardy proved that an infinite number of zeros lie on the critical line Re(s) = ½.
However, it was still possible that an infinite number (and possibly the majority) of non-trivial
zeros could lie elsewhere in the critical strip. Later work by Hardy and Littlewood in 1921
and by Selberg in 1942 gave estimates for the average density of zeros on the critical line.
The Riemann hypothesis and primes
The zeta-function has a deep connection to the distribution of prime numbers. Riemann gave
an explicit formula for the number of primes less than a given number in terms of a sum over
the zeros of the Riemann zeta function. Helge von Koch proved in 1901 that the Riemann
hypothesis is equivalent to the following considerable strengthening of the prime number
theorem: for every ε > 0, we have
where π(x) is the prime-counting function, ln(x) is the natural logarithm of x, and the Landau
notation is used on the right-hand side.[5] A non-asymptotic version, due to Lowell Schoenfeld,
says that the Riemann hypothesis is equivalent to
The zeros of the Riemann zeta-function and the prime numbers satisfy a certain duality
property, known as the explicit formulae, which shows that in the language of Fourier analysis
the zeros of the Riemann zeta-function can be regarded as the harmonic frequencies in the
distribution of primes.
The Riemann hypothesis can be generalized by replacing the Riemann zeta-function by the
formally similar, but much more general, global L-functions. In this broader setting, one
expects the non-trivial zeros of the global L-functions to have real part 1/2, and this is called
the generalized Riemann hypothesis (GRH). It is this conjecture, rather than the classical
Riemann hypothesis only for the single Riemann zeta-function, which accounts for the true
importance of the Riemann hypothesis in mathematics. In other words, the importance of 'the
94
Riemann hypothesis' in mathematics today really stems from the importance of the
generalized Riemann hypothesis, but it is simpler to refer to the Riemann hypothesis only in
its original special case when describing the problem to people outside of mathematics.
For many global L-functions of function fields (but not number fields), the Riemann
hypothesis has been proven. For instance, the fact that the Gauss sum, of the quadratic
character of a finite field of size q (with q odd), has absolute value
is actually an instance of the Riemann hypothesis in the function field setting.
Consequences and equivalent formulations of the Riemann hypothesis
The practical uses of the Riemann hypothesis include many propositions which are stated to
be true under the Riemann hypothesis, and some which can be shown to be equivalent to the
Riemann hypothesis. One is the rate of growth in the error term of the prime number theorem
given above.
Riemann was particularly interested in feeding imaginary numbers into functions. Usually we
can draw a graph of a function where the input runs along the horizontal and the output is the
height of the graph. But a graph of an imaginary function consists of a landscape where the
output is represented by the height above any point in the world of imaginary numbers.
An imaginary landscape
Riemann had found one very special imaginary landscape, generated by something called the
zeta function, which he discovered held the secret to prime numbers. In particular, the points
at sea-level in the landscape could be used to produce these special harmonic waves which
changed Gauss's graph into the genuine staircase of the primes. Riemann used the coordinates
of each point at sea-level to create one of the prime number harmonics. The frequency of each
harmonic was determined by how far north the corresponding point at sea-level was, and how
loud each harmonic sounded was determined by the east-west frequency.
Riemann’s sinus – waves what created with zero place Zeta – topography, they showed hidden
harmony.
A prime number is a positive whole number greater than one which is divisible only by itself
and one. The first few are shown above. If the definition doesn’t mean much to you, think of
prime numbers as follows:
If you are presented with a pile of 28 stones, you will eventually deduce that the pile can be
divided into 2 equal piles of 14, 4 equal piles of 7, 7 equal piles of 4, etc. However, if one
more stone is added to the pile, creating a total of 29, you can spend as long as you like, but
you will never be able to divide it into equal piles (other than the trivial 29 piles of 1 stone).
In this way, we see that 29 is a prime number, whereas 28 is non-prime or composite.
All composites break down uniquely into a product of prime factors: i.e. 28 = 2 x 2 x 7. Note
95
that 2 is the only even prime - all other even numbers are divisible by 2. 1 is neither prime nor
composite by convention.
Here the sequence of primes is presented graphically in terms of a step function or counting
function which is traditionally denoted . (Note: this has nothing to do with the value
=3.14159...) The height of the graph at horizontal position x indicates the number of
primes less than or equal to x. Hence at each prime value of x we see a vertical jump of one
unit. Note that the positions of primes constitute just about the most fundamental, inarguable,
nontrivial information available to our consciousness. This transcends history, culture, and
opinion. It would appear to exist 'outside' space and time and yet to be accessible to any
consciousness with some sense of repetition, rhythm, or counting. The explanation in the
previous page involving piles of stones can be used to communicate the concept of prime
numbers without the use of spoken language, or to a young child
By zooming out to see the distribution of primes within the first 100 natural numbers, we see
that the discrete step function is beginning to suggest a curve.
96
Zooming out by another factor of 10, the suggested curve becomes even more apparent.
Zooming much further, we would expect to see the "granular" nature of the actual graph
vanish into the pixilation of the screen.
Now zooming out by a factor of 50, we get the above graph. Senior Max Planck Institute
mathematician Don Zagier, in his article "The first 50 million primes" [Mathematical
Intelligencer, 0 (1977) 1-19] states:
"For me, the smoothness with which this curve climbs is one of the most astonishing facts in
mathematics."
(Note however that you are not looking at a smooth curve. Sufficiently powerful
magnification would reveal that it was made of unit steps. The smoothness to which Zagier
refers is smoothness in limit.)
The juxtaposition of this property with the apparent 'randomness' of the individual positions
of the primes creates a sort of tension which can be witnessed in many popular-mathematical
accounts of the distribution of prime numbers. Adjectives such as "surprising", "astonishing",
97
"remarkable", "striking", "beautiful", "stunning" and "breathtaking" have been used. Zagier
captures this tension perfectly in the same article:
In 1896, de la Valee Poussin and Hadamard simultaneously proved what had been suspected
for several decades, and what is now known as the prime number theorem:
In words, the (discontinuous) prime counting function is asymptotic to the (smooth)

logarithmic function x/log x. This means that the ratio of to x/log x can be made
arbitrarily close to 1 by considering large enough x. Hence x/log x provides an approximation
of the number of primes less than or equal to x, and if we take sufficiently large x this
approximation can be made as accurate as we would like (proportionally speaking - very
simply, as close to 100% accuracy as is desired).
The original proofs of the prime number theorem suggested other, better approximations. In
the above graph we see that x/log x, despite being asymptotic to , is far from being the
smooth function which suggests when we zoom out - there is plenty of room for
improving the approximation. These improvements turn out to be greatly revealing.
The first improvement on x/log x we consider is the logarithmic integral function Li(x). This
is defined to be the area under the curve of the function 1/log u between 2 and x, as illustrated
98
in the left-hand figure. Gauss arrived at this from the empirical fact that the probability of
finding a prime number at an integer value near a very large number x is almost exactly 1/log
x.
l'Hopital's rule can be used to show that the ratio of x/log x to tends to 1
as x approaches infinity. Thus we may use either expression as an approximation to in
the statement of the prime number theorem.
In the right-hand figure we see that this function provides an excellent fit to the function
. As Zagier states, "within the accuracy of our picture, the two coincide exactly."
Zagier goes on to state:

"There is one more approximation which I would like to mention. Riemann's research on
prime numbers suggests that the probability for a large number x to be prime should be even
closer to 1/log x if one counted not only the prime numbers but also the powers of primes,
counting the square of a prime as half a prime, the cube of a prime as a third, etc. This leads to
the approximation
or, equivalently,
The function on the right side . . . is denoted by R(x), in honor of Riemann. It represents an
amazingly good approximation to as the above values show."
To be clear about this, it should be pointed out that the explicit definition for the the function
R(x) is
where are the Möbius numbers. These are defined to be zero when n is divisible by a
square, and otherwise to equal (-1)k where k is the number of distinct prime factors in n. As 1
has no prime factors, it follows that (1) = 1.
99
It seems, then, that the distribution of prime numbers 'points to' or implies Riemann's function
R(x). This function can be thought of as a smooth ideal to which the actual, jagged, prime
counting function clings. The next layer of information contained in the primes can be seen
above, which is the result of subtracting from R(x). This function relates directly to the
local fluctuations of the density of primes from their mean density.
In their article "Are prime numbers regularly ordered?", three Argentinian chaos theorists
considered this function, treated it as a 'signal', and calculated its Liapunov exponents. These
are generally computed for signals originating with physical phenomena, and allow one to
decide whether or not the underlying mechanism is chaotic. The authors conclude
"...a regular pattern describing the prime number distribution cannot be found. Also, from a
physical point of view, we can say that any physical system whose dynamics is unknown but
isomorphic to the prime number distribution has a chaotic behavior."
A physicist shown the above graph might naturally think to attempt a Fourier analysis - i.e. to
see if this noisy signal can be decomposed into a number of periodic sine-wave functions. In
fact something very much like this is possible. To understand how, we must look at the
Riemann zeta function.
Some numbers have the special property that they cannot be expressed as the product of two
smaller numbers, e.g., 2, 3, 5, 7, etc. Such numbers are called prime numbers, and they play
an important role, both in pure mathematics and its applications. The distribution of such
prime numbers among all natural numbers does not follow any regular pattern; however the
German mathematician G.F.B. Riemann (1826 - 1866) observed that the frequency of prime
numbers is very closely related to the behavior of an elaborate function
ζ(s) = 1 + 1/2s + 1/3s + 1/4s +...
called the Riemann Zeta function. The Riemann hypothesis asserts that all interesting
solutions of the equation
ζ(s) = 0
lie on a certain vertical straight line. This has been checked for the first 1,500,000,000
solutions. A proof that it is true for every interesting solution would shed light on many of the
mysteries surrounding the distribution of prime numbers.
100
Object 318
Primes seem to be, at the same time very irregularly distributed among all numbers, and yet –
if squinted at from a sufficiently far distance – they reveal an astoundingly elegant pattern.
Object 320
He also formulated a conjecture about the location of these zeros, which fall into two classes:
the “obvious zeros” -2, -4, -6, etc., and those whose real part lies between 0 and 1. Riemann’s
101
conjecture was that the real part of the non obvious zeros is exactly ½. That is, they all lie on a
specific vertical line in the complex plane.
Over 2,300 years ago Euclid proved that the number of primes is infinite, so two possible
questions come to mind:
1. How many primes are there less than the number x?
2. There are infinitely many primes, but how big of an infinity?
This document will focus on the first question.
π(x) is the number of primes less than or equal to x
Let x be a positive real number. The question "how many primes are there less than x?" has
been asked so frequently that its answer has a name:
[π (x) using the Greek letter pi] = π(x) = the number of primes less than or equal to x.
The primes under 25 are 2, 3, 5, 7, 11, 13, 17, 19 and 23 so π(3) = 2, π(10) = 4 and π25) = 9.
Object 323
Table 1. Values of π(x)
x π(x) reference
10 4
100 25
1,000 168
10,000 1,229
102
100,000 9,592
1,000,000 78,498
10,000,000 664,579
100,000,000 5,761,455
1,000,000,000 50,847,534
10,000,000,000 455,052,511
100,000,000,000 4,118,054,813
1,000,000,000,000 37,607,912,018
10,000,000,000,000 346,065,536,839
100,000,000,000,000 3,204,941,750,802 [LMO85]
1,000,000,000,000,000 29,844,570,422,669 [LMO85]
10,000,000,000,000,000 279,238,341,033,925 [LMO85]
100,000,000,000,000,000 2,623,557,157,654,233 [DR96]
1,000,000,000,000,000,000 24,739,954,287,740,860 [DR96]
10,000,000,000,000,000,000 234,057,667,276,344,607
100,000,000,000,000,000,000 2,220,819,602,560,918,840
1,000,000,000,000,000,000,000 21,127,269,486,018,731,928
10,000,000,000,000,000,000,000 201,467,286,689,315,906,290
100,000,000,000,000,000,000,000 1,925,320,391,606,803,968,923
On the number of primes less than a given magnitude.
In 1859 the German mathematician Bernard Riemann proposed a way of understanding and
refining that pattern. Its main result is a suggestion, not rigorously proved, for a perfectly
precise formula giving the number of primes less than a given quantity. His hypothesis has
wide – ranging implications, and this day after 150 years of careful research and exhaustive
study we know it is correct.
There are 4 primes up to 10 (2, 3, 5, 7), because those they cannot be expressed as the product
of two smaller numbers (4 = 2(2), 8 = 4(2), 9 = 3(3), 10 = 5(2). Between 1 and 100 there are
25 primes, and 168 primes up to 1 000. Why 168? Is there a rule, a formula, to tell me how
many primes there are less than a given number? Can we find a rule, a law, to describe the
thinning out?
The formula is simple: The ratio of half a given number by a given number N, is directly
proportional to the quotient of quantity prime numbers by its dual quantity.
½N : N = πx : 2(πx) πx ∝ ½N ½N(2 πx) = N(πx) πx/(2 πx) = y = ½
2πx(½) = πx
N πx
1,0 E+3 168
1,0 E+6 78498
1,0 E+9 50847534
1,0 E+12 37607912018
1,0 E+15 29844570422669
1,0 E+18 24739954287740860
211272694601873192
1,0 E+21 8
103
A two – column table like this is an illustration of a function. The main idea of a function is
that some number depends on some other number according to some fixed rule or procedure.
Another way to say the same thing is: a function is a way to turn (“maps”) a number in to
another number. The function πx ∝ ½N turns, or maps, the number 1000 in to the number 168
– again, by way of some definite procedure. 500(336) = 1000(168)
Therefore primes there are less than a given number sure do thin out, but are directly
proportional to the half a given number.
Ultimately, it is in the Riemann Hypothesis about the multiplicative basic building blocks of
natural numbers to understand: the primes. Can their distribution in the sea of natural numbers
mean? How long do you calculate until the next prime coming? Why is the next prime
number, such as accidental times already after a few steps, sometimes on the other hand, only
after great distance? Is there perhaps a hidden pattern?
Theorem: If the quotient of half a given magnitude ½N, by a given magnitude N, is equal to
the quotient of quantity prime numbers, by its dual quantity, so in this equation is
a proportional relation, that is, in each equation the product of the inner members
equal to the product of outer members.
Proof: ½N : N = πx : 2(πx) πx ∝ ½N ½N(2 πx) = N(πx) πx/(2 πx) = Re(s) = ½
1/2 N ( 2 πx )
=
5/10 = 4/8 = 1/2 8(1/2) = 4 2πx (½) = πx N
½N : N = πx : 2πx = (N – 4)/6 : 2(N – 4)/6 = n(pp’) : 2n(pp’)
Object 326
If in several of the same ratios product outer members, is equal to the product of the inner
members, then they say about so-called continuous proportion. Therefore, more equal ratios
with each other can also be written, as a continuous proportion.
104
↔ ½N : πx : (N – 4)/6 : n(pp’) = N : 2πx : 2(N – 4)/6 : 2n(pp’)
Object 328
The above mentioned bar diagram shows, as from asymptote diminishing / the sum / quantity
of primes and odd numbers( the blue column) in half of given magnitude, monotonously
grows up the difference among half of given magnitude and quantity of primes and odd
numbers, which it is the rest of products of primes( the pink column).
If the interval first 10 numbers come before 4 primes, then in the interval of 100 numbers 25
prime numbers occur, and each number in the interval, the proportion ½ is to keep.
Observe of proportion ½ in every the block N of numbers is, so the guarantee, that in
necessity primes never will disappear because asymptote diminishing quantity of primes and
odd numbers in half of given magnitude causes monotonous growth of quantity of products
primes. In other words, all zeros of ζ(s) in the half-plane Re(s) > 0 have real part ½ .
In mathematics, two quantities are said to be proportional if they vary in such a way that one
of the quantities is a constant multiple of the other, or equivalently if they have a constant
ratio. Proportion also refers to the equality of two ratios. In proportional quantities is the
doubling (tripling, halved) one quantity is always a double (triple, halve) connected to the
other quantities.
The proportion of ½ means, that is involved in the creation of a half-block of numbers twice
the amount of prime numbers. 5/10 = 4/8 50/100 = 25/50 500/1000 = 168/336
1=3–2 5=3+2 7=5+2 9=7+2
11 = 9 + 2 13 = 11 + 2 15 = 13 + 2 17 = 15 + 2 19 = 17 + 2 21 = 19 + 2 23 = 21 + 2
25 = 23 + 2 27 = 25 + 2 29 = 27 + 2 31 = 29 + 2 33 = 31 + 2 35 = 33 + 2 37 = 35 + 2
105
39 = 37 + 2 41 = 39 + 2 43 = 41 + 2 45 = 43 + 2 47 = 45 + 2 49 = 47 + 2 51 = 49 + 2
53 = 51 + 2 55 = 53 + 2 57 = 55 + 2 59 = 57 + 2 61 = 59 + 2 63 = 61 + 2 65 = 63 + 2
67 = 65 + 2 69 = 67 + 2 71 = 69 + 2 73 = 71 + 2 75 = 73 + 2 77 = 75 + 2 79 = 77 + 2
81 = 79 + 2 83 = 81 + 2 85 = 83 + 2 87 = 85 + 2 89 = 87 + 2 91 = 89 + 2 93 = 91 + 2
95 = 93 + 2 97 = 95 + 2 99 = 97 + 2
It is easy to see that 2, 3 and 5 is the next prime number in the top ten numbers. The next
consecutive prime numbers is always divided into odd number, which is the arithmetic
average and a multiple of three. It is of great importance for the deployment on both sides of
primes.
These triplets consecutive odd numbers to 100 (N) is 100 - 4 / 6 = 16, including 25 primes and
9 almost prime, giving a total of half a given quantity ½ N.
50 = 16 + 25 + 9
The question arises whether it is possible to allocate such an elementary function, which give
the number of primes of a given size N. How distributed are the prime numbers among
natural numbers best describes the function:
Object 330
All zeros of ζ(s) in the half-plane Re(s) > 0 have real part ½.
1 /2 N (2 πx )
½ N/N = πx/2πx then πx =
N
[p + (p+8)]/2 = 2n – 1 then 2(2n – 1) = [p + (p+8)] p = [2(2n – 1) – 8]/2

106
[5 + (5 + 8)]/2 = 9 2(9) = [5 + (5 + 8)] 5 = [2(9) – 8]/2

[11 + (11 + 8)]/2 = 15 2(15) = [11 + (11 + 8)] 11 = [2(15) – 8]/2
The Riemann Hypothesis is about the distribution of primes in the sea of natural numbers.
This sea is defined over the sum, because of numbers will always be number 1 add – just the
normal process of counting. The primes, however, are about the multiplication defined, they
are about the factorization the prime multiplicative components of the natural numbers.
The distribution of primes and the Riemann Hypothesis says something about the changing
relationship between addition and multiplication of natural numbers. Both are not problems
for themselves, but both together are incredibly complex and still not fully penetrated, such as
the lack of evidence for the Riemann Hypothesis impressive displays.
All these ideas are based on an analogy, which is easier to describe something like this lets:
The primes are “elementary particles”, which are about the multiplication in interaction occur
and so the composite numbers up. At the same time, “the particles” are arranged through the
addition. In the zeta functions are now in the form of a sum – relatively product formula both
aspects (additive/natural numbers and multiplicative/primes) linked.
2 + 3 = 5 + 2 = 2(2) + 3 = 7 + 3 + 2 = 12 = 6(2)
2 + 3 = 5 + 4(2) = 13 = 5(2) + 3 + 5 = 18 = 9(2)
4(2) + 3 = 11 + 4(2) = 19 = 8(2) + 3 + 11 = 30 = 15(2)
7(2) + 3 = 17 + 4(2) = 25 = 5(2 + 3) + 17 = 42 = 21(2)
10(2) + 3 = 23 + 4(2) = 31 = 14(2) + 3 + 23 = 54 = 27(2)
13(2) + 3 = 29 + 4(2) = 37 = 17(2) + 3 + 29 = 66 = 33(2)
Object 334
Riemann for help of total numbers translated distribution of prime numbers in mathematical
scenery on two-dimensional plane (so called zeta-function). It topography of this scenery
107
contains near this general knowledge about prime numbers. It will suffice, so to know on level
of sea points (zero places), to can reconstruct whole scenery.
Because zero places contain all information about distribution of prime numbers. Riemann
created concrete formula, to right away zero to regain distribution of prime numbers. Near
what every zero place is how source for spreading wave we which can introduce me as
acoustic sound. Sounds of all zero places overlap on me in distribution of prime numbers.
Near what zero place is about so many louder, if it lies further eastwards (in right from axis -
y), and her sound is about so many higher, if it lies further north (over axis - x).
Assuming proportional functions graphically in a coordinate system, so you can see that
proportional functions are monotonically increasing. The properties of the zeroes out in the
complex plane determine the properties of the primes! Riemann conjectured that all the
relevant zeroes have real part ½ .
The statement that the equation πx/2(πx) = y = ½, is valid for every x with real part equal ½,
with the quotient on the right hand side converging, is equivalent to the Riemann hypothesis.
Object 336
They fill with the same gap in thousands theorems basing on legitimacy Riemann’s
hypothesis. Because many mathematicians be obliged for its results such presumption to
accept. Primes betrayed their secret, and by this was proved Riemann’s Hypothesis A solution
of the Riemann Hypothesis are huge implications for many other mathematical problems. The
transformation of hypothesis the Riemann in theorem, suddenly it proves all the not proved
results. Riemann Hypothesis admits to receive, so that really every from infinitely of many, of
zero places lies on this straight line then it means, that all sounds in music of prime numbers
are alike loud. This would mean, it that was can distribution of prime numbers to me really
108
introduce how even throw dice. Hexahedron dice after line of natural numbers rolls, which
what second and fourth wall shows next prime number or almost prime.
5_7__11_13__17_19__23_25=5·5__29_31__35=5·7_37__41_43__47_49=7·7__53_55=11·5
__59_61__65 = 13·5_67__71_73__77 = 11·7_79__83_85 = 17·5__89_91 = (13·7)_95 = 19·5
Object 338
The above diagram illustrates what makes a ½ real part of primes for a given quantity π 100.
Well, two parallel sequence of 25 primes and 9 of their product (25, 35, 49,) with a constant
gap 6, which gives 16 odd numbers divisible by 3, as their mean.
In every blocks of natural numbers in proportion ½ that πx primes, almost prime p(p) and odd
numbers divisible by 3 (N – 4)/6. And so the ½ ratio is maintained in subsequent blocks of
numbers. Look again at the table showing the proportion of primes amongst all odd numbers.
N πx (N- 4)/6 n(pp’) Σ½ N

100 25 16 9 50
1,0 E+03 168 166 166 500
1,0 E+06 78 498 166 666 254 836 500 000
1,0 E+09 50 847 534 166 666 666 282 485 800 500 000 000
1,0 E+12 37 607 912 018 166 666 666 666 295 725 421 316 500 000 000 000
1,0 E+15 29844570422669 166666666666666 303488762910665 500000000000000
1,0 E+18 24739954287740860 166666666666666666 308593379045592474 500000000000000000
If the quotient of half a given magnitude ½N, by a given magnitude N, is equal to the quotient of
quantity prime numbers, by its dual quantity, then half a given magnitude is the sum quotients of
common divisor. That is to say, the proportion of odd number in given magnitude is the sum of 3
successive proportion.
109
½N : N= πx : 2πx =(N – 4)/6 : 2(N – 4)/6=½N – [πx+(N – 4)/6] : 2{½N – [πx+(N – 4)/6]}= k
then πx + (N – 4)/6 + [½N – (N – 4)/6] = k{2πx + 2(N – 4)/6 + 2{½N – [πx + (N – 4)/6]}
N −4
½N ½ N−[πx + ]
=¿ πx (N −4) /6 6 50/50 = 25/50 + 16/50 + [50 – (25
½N + +
½N ½N ½N
+16)]/50
The following table provides an overview of this.
πx (N - 4)/6 p(p) 1/2 N

25/50 16/50 9/50 50/50
168/500 166/500 166/500 500/500
1229/5000 1666/5000 2105/5000 5 000/5000
9592/50000 16 666/50000 23742/50000 50 000/50000
78498/500000 166 666/500000 254836/500000 500 000/500000
664579/5000000 1 666666/500000 2668755/500000 5 000000/5000000
5761455/50000000 16666666/50000000 27571879/50000000 50000000/50000000
50847534/500000000 166666666/500000000 282485800/500000000 500000000/500000000
Object 344
Half of given magnitude ½N (purple column) it is sum diminishing quantity of primes πx (the
blue column) and the quotient of odd numbers (N - 4) : 6( the pink column), as well as the
growing products of primes n( pp') ( the green column) resulting with difference among half of
110
given magnitude and sum of quantity of primes and odd numbers {½N - [πx + (N - 4)/ 6]}.
The down mentioned bar diagram shows how does constantly diminishing quantity of primes πx
(green bar) and the quotient of odd numbers (N - 4)/6 (pink bar), they in total enlarge growing
difference of primes products (blue bar).
If the half of given magnitude as member of geometrical sequence is geometrical mean two
neighboring terms, then every of these terms is the sum of several components.
an +1 = an−1 + (10)n q an +1 = √an−1 +(10)n q · a n+1 +(10)n q 5 000 = 500 +

(10²)45
50 = √ 5· 500 ½N = (N – 4)/6 + 2(N – 4)/6 + 2 50 = (100 – 4)/6 + 2(16) +

2
5 000 = (10 000 – 4)/6 + 2(10 000 – 4)/6 + 2 = 1 666 + 2(1 666) + 2 = 1 666 + 3 334
Object 358
(N – 4)/6 + [πx + n(pp’) = 2(N – 4)/6 +2] = ½N = 3(N – 4)/6 + 2
(10 – 4)/6 + [4 + 0 = 2(10 – 4)/6+2] = 5 = 3(10 – 4)/6+ 2
1 + [4 + 0 = 2(1) + 2] (4) = 5 = 3(1) + 2

111
10(1,5) + [21 + 9 = 3(10)]+ = 10(4,5) +
16 + [25 + 9 = 2(16) +2] (34) = 50 = 5(10) 3(16) + 2
10²(1,5) + [143 + 157 = 3(10²)]+ = 10²(4,5) +
166 + [168 + 166 = 2(166)+2] (334) = 500= 5(10²) 3(166) + 2
10³(1,5) + [1061 + 1939 = 3(10³)]+ = 10³(4,5) +
1666 + [1229 + 2105 = 2(1666)+2](3334) = 5 000 = 3(1666) + 2
10⁴(1,5) + [8363 + 21637 = 3(10⁴)]+ = 10⁴(4,5) +
16 666 + [9592 + 23 742 = 33 334] = 50 000 = 3(16666) + 2
10⁵(1,5) + [68906 + 231094 = 3(10⁵)]+ = 10⁵(4,5) +
166 666 + [78 498 + 254 836 = 333 334] = 500 000 = 3(166666) + 2
10⁶(1,5) + [586 081 + 2 413 919= 3(10⁶)]+ = 10⁶(4,5) +
1 666 666 + [664 579 + 2 668 755 = 3 333 334] = 5000000 = 3(1666666)+2
10⁷(1,5) + [5 096 876 + 24 903 124 = 3(10⁷)]+ = 10⁷(4,5) +
16 666666 + [5 761 455 + 27 571 879 = 33 333 334] = 50000000 = 3(16666666)+2
10⁸(1,5) + [45074079 + 254910921 = 3(10⁸)]+ = 10⁸(4,5) +
166 666666 + [50 847534 + 282 485800 = 333 333334] =500000000= 3(166666666)+2
10⁹(1,5) + [404204977+ 2595795023= 3(10⁹)]+ = 10⁹(4,5) +
1666666666+ [455052511+ 2878280823= 3 333 333334] =5000000000= 3(1666666666)+2
If half of the given magnitude is growing in geometrical sequence 5(q), then the sum of
difference
between prime numbers and almost prime in geometrical sequence 3 (q).

112
Object 360
Object 362
Although the sum of the differences between prime and almost prime growing in geometrical
sequence 3 (q) equals half of the given magnitude growing in geometrical sequence 5 (q), as
shown in the above diagram, since the prime and almost prime are components of half a given
magnitude, and steadily declining prime sequence (green bar), results in steady increase in the
almost prime sequence (blue bar). Here we see the interdependence of all numbers in the half of
113
the given magnitude of asymptotically decreasing number of primes, in hidden arithmetical

sequence with constant difference d = 2².
In 50 odd half figures / 25 / is the prime number, the rest (16 + 9) is product of primes. This is
the (N - 4) / 6 = 16 multiples of 3 (9, 15, 21, 27, 33, 39, 45, 51, 57, 63, 69, 75, 81, 87, 93, 99) and
9 (pp ') other products of prime numbers (25, 35, 49, 55, 65, 77, 85, 91, 95). Multiples of the
number 3 in given magnitude are always quotient of the number 6 in the difference (N - 4) as
there are intervals fixed every 6 numbers.
50 - 16 = 34 = 25 + 9 Subtracting from the half of given magnitude multiple receive the
remainder consisting of prime numbers and their product.
½ N - [N - 4] / 6 = πx + n (pp ') This equation is very interesting, because we consider their
information content, it is on the right side of an expression, which is made up of all prime
numbers and their products and on the left side is an expression that is composed of all odd
numbers. This means however, that in the infinite sum the information on primes implicitly built
is.
So the differences and the sum of the numbers making up half of a given magnitude must be
equal.
The sum of prime numbers and their products is growing steadily by the difference between the
half of given magnitude and number of quotients the number 6 in given magnitude.
Asymptotically decreasing the number of primes is always half difference between prime
numbers and their products, causes steady increase in products of primes, too by half difference
between them. Differences and the sum of these two equations are equal to half the sum of
primes and their products, as shown in the diagram below.
Object 364
In this way, proportion ½ of primes, almost prime and odd numbers take up 100% of the area of 100
blocks numbers.
½ N = πx + {½ N – [πx + (N-4)/6]}+(N-4)/6 50 = 25 + [50 – (25 +16)] + 16

114
Theorem:
The nth term “ an ” of an arithmetic sequence with first term a, and constant difference “d” is
given by the explicit formula
an =a1 + (n – 1)d t n = a + (n – 1)d
a1=¿ 11 d = 12 a9 =? = 11 + (9 – 1)12 = 11 + 8(12) = 107
a = 7 d = 12 t 9=? = 7 + (9 – 1)12 = 7 + 8(12) = 7 + 96 = 103
n 2 3 2n - 1 = k n(5) n(7) n(11) n(13) n(17) n(19) n(23)

1 5 7 11 13 9 15
2 17 19 23 21 27 25
3 29 31 37 33 39 35
4 41 43 47 45 51 49
5 53 59 61 57 63 55
6 67 71 73 69 75 65
7 79 83 81 87 85 77
8 89 97 93 99 95 91
9 101 103 107 109 105 111
10 113 117 123 115 119 121
11 127 131 129 135 125 133
12 137 139 141 147 145 143
13 149 151 157 153 159 155
14 163 167 165 171 161 169
15 173 179 181 177 183 175
16 191 193 189 195 185 187
17 197 199 201 207 205 203
18 211 213 219 215 217 209
19 223 227 229 225 231 221
20 233 239 241 237 243 235
21 251 249 255 245 253 247
22 257 263 261 267 265 259
23 269 271 277 273 279 275
24 281 283 285 291 287 289
25 293 297 303 295 301 299
26 307 311 313 309 315 305
27 317 321 327 325 319 323
28 331 337 333 339 335 329
29 347 349 345 351 343 341
30 353 359 357 363 355 361
31 367 373 369 375 365 371
32 379 383 381 387 385 377
33 389 397 393 399 395 391
34 401 409 405 411 407 403
35 419 421 417 423 415 413
36 431 433 429 435 425 427
115
37 439 443 441 447 445 437

38 449 457 453 459 455 451
39 461 463 467 465 471 469
40 479 477 483 475 473 481
41 487 491 489 495 485 493
42 499 503 501 507 505 497
43 509 513 519 515 511 517
44 521 523 525 531 527 529
45 541 537 543 535 539 533
46 547 549 555 545 553 551
47 557 563 561 567 565 559
48 569 571 577 573 579 575
49 587 585 591 581 583 589
50 593 599 601 597 603 595
51 607 613 609 615 605 611
52 617 619 621 627 625 623
53 631 633 639 635 637 629
54 641 643 647 645 651 649
55 653 659 661 657 663 655
56 673 669 675 665 671 667
57 677 683 681 687 685 679
58 691 693 699 695 689 697
59 701 709 705 711 707 703
60 719 717 723 715 721 713
61 727 733 729 735 725 731
62 739 743 741 747 745 737
63 751 757 753 759 755 749
64 761 769 765 771 763 767
65 773 777 783 775 781 779
66 787 789 795 785 791 793
67 797 801 807 805 803 799
68 809 811 813 819 815 817
69 821 823 827 829 825 831
70 839 837 843 835 833 841
71 853 849 855 845 847 851
72 857 859 863 861 867 865
73 877 873 879 875 869 871
74 881 883 887 885 891 889
75 897 903 895 901 893 899
76 907 911 909 915 905 913
77 919 921 927 925 917 923
78 929 937 933 939 935 931
79 941 947 945 951 949 943
80 953 957 963 955 959 961
81 967 971 969 975 965 973
82 977 983 981 987 985 979
116
83 991 997 993 999 995 989
Object 380
Theorem:
Given number “a” is prime, if their even part equal is to the number 2, 4, 8, 10, or continue term in
their arithmetic sequence with constant difference d = 12 (2, 4, 8, 10) + n(12)
a = (2, 4, 8, 10) + n(12) = p = n(2) + 3
173 – 3 = 170 = 2 + 14(12) 191 – 3 = 188 = 8 + 15(12)
2 + n(12) 4 + n(12) 8 + n(12) 10+ n(12) 2 3

2 4 8 10 5 7 11 13
14 16 20 17 19 23
26 28 34 29 31 37
38 40 44 41 43 47
50 56 58 53 59 61
64 68 70 67 71 73
76 80 79 83
86 94 89 97
98 100 104 106 101 103 107 109
110 113
124 128 127 131
134 136 137 139
146 148 154 149 151 157
160 164 163 167
170 176 178 173 179 181
117
188 190 191 193

Perfect sieve.
2 3 2n - 1 = k
5 7 11 13 9 15
17 19 23 21 27 25
29 31 37 33 39 35
41 43 47 45 51 49
53 59 61 57 63 55
67 71 73 69 75 65
79 83 81 87 77 85
89 97 93 99 91 95
101 103 107 109 105 111
113 117 123 115 119 121
127 131 129 135 125 133
137 139 141 147 143 145
149 151 157 153 159 155
163 167 165 171 161 169
173 179 181 177 183 175
191 193 189 195 185 187
197 199 201 207 203 205
211 213 219 209 215 217
223 227 229 225 231 221
233 239 241 237 243 235
251 249 255 245 247 253
257 263 261 267 259 265
269 271 277 273 279 275
281 283 285 291 287 289
293 297 303 295 299 301
307 311 313 309 315 305
317 321 327 319 323 325
331 337 333 339 329 335
347 349 345 351 341 343
353 359 357 363 355 361
367 373 369 375 365 371
379 383 381 387 377 385
389 397 393 399 391 395
401 409 405 411 403 407
419 421 417 423 413 415
431 433 429 435 425 427
439 443 441 447 437 445
118
449 457 453 459 451 455

461 463 467 465 471 469
479 477 483 473 475 481
487 491 489 495 485 493
499 503 501 507 497 505
509 513 519 511 515 517
521 523 525 531 527 529
541 537 543 533 535 539
547 549 555 545 551 553
557 563 561 567 559 565
569 571 577 573 579 575
587 585 591 581 583 589
593 599 601 597 603 595
607 613 609 615 605 611
617 619 621 627 623 625
631 633 639 629 635 637
641 643 647 645 651 649
653 659 661 657 663 655
673 669 675 665 667 671
677 683 681 687 679 685
691 693 699 689 695 697
701 709 705 711 703 707
719 717 723 713 715 721
727 733 729 735 725 731
739 743 741 747 737 745
751 757 753 759 749 755
761 769 765 771 763 767
773 777 783 775 779 781
787 789 795 785 791 793
797 801 807 799 803 805
809 811 813 819 815 817
821 823 827 829 825 831
839 837 843 833 835 841
853 849 855 845 847 851
857 859 863 861 867 865
877 873 879 869 871 875
881 883 887 885 891 889
897 903 893 895 899 901
907 911 909 915 905 913
919 921 927 917 923 925
929 937 933 939 931 935
119
941 947 945 951 943 949

953 957 963 955 959 961
967 971 969 975 965 973
977 983 981 987 979 985
991 997 993 999 989 995
1009 1005 1011 1001 1003 1007
1013 1019 1021 1017 1023 1015
1031 1033 1029 1035 1025 1027
Perfect sieve similarly how sieve Eratosthenes be bases on principle that all natural numbers
congruent to me according module 0 mod. 6. Arranging one after another only odd numbers have
begun for primes 2, 3 what second and fourth (5 - 7 - 11 - 13), because third and fifth is multiplicity
number 3 always, we will receive four sequences of primes about constant difference d = 12 (17 - 19 -
23 - 25). We choose 25 = 5(5)now, then the number almost prime, as the multiplicity number 5, second
will be about 2(5) = 10 larger, that is 25 + 10 = 35 = 7(5), third about 4(5) = 20 larger, that is 35 + 20 =
55 = 11(5) and fourth again about 2(5) = 10 larger, that is 55 + 10 = 65 = 13(5) and further already in
constant space, what 5(12) = 60 from every of them 25 + 60 = 85 35 + 60 = 95 " we sow” all
multiplicities of prime 5.
49 = 7(7), then number almost prime, as multiplicity number 7, second will be about 4(7) = 28 larger,
that is 49 + 28 = 77 = 11(7), third about 2(7) = 14 larger, that is 77 + 14 = 91 = 13(7) and fourth again
about 4(7) = 28 larger, 91 + 28 = 119, and further in constant space, what 7(12) = 84 we sow all
multiplicities of prime 7. (49 + 84 = 133 77 + 84 = 161 91 + 84 = 175 …)
121 = 11(11), then number almost prime, as multiplicity number 11, second will be about 2(11) = 22
larger, 121 + 22 = 143 = 13(11), third about 4(11) = 44 larger, 143 + 44 = 187 = 17(11), and fourth
about 2(11) = 22 larger, 187 + 22 = 209 = 19(11), and further in constant space, what 11(12) = 132 we
sow all multiplicities of prime 11. (121 + 132 = 253 143 + 132 = 275 …)
169 = 13(13), then the number almost prime, as the multiplicity number 13, second will be about 4(13)
= 52 larger, 169 + 52 = 221 = 17(13), third about 2(13) = 26 larger, 221 + 26 = 247 = 19(13), fourth
about 52 larger, 247 + 52 = 299 = 23(13), and further in constant space, what 13(12) = 156 sow all
multiplicities of prime13. (169 + 156 = 325 = 25(13) 221 + 156 = 377 = 29(13) …) In the same way
we sow all remaining multiplicities of next primes.
Theorem:
If even half of an odd number after deducting the (7, 10, 16, 19, 25, 28, 34, 43, 46), is divisible by (5,
7, 11, 13, 17, 19, 23, 29, 31). This certainly is a complex number.
Proof: (a - 1)/2 - (7, 10, 16, 19, 25, 28, 34, 43, 46)/(5, 7, 11, 13, 17, 19, 23, 29, 31) = p (p ')
2009 - 1 = 2008 / 2 = 1004 - 10 = 994 / 7 = 142 2009 = 7 (287) = 7 (284 + 3)
1067 - 1 = 1066 / 2 = 533 - 16 = 517/11 = 47 1067 = 11 (97) = 11 (94 + 3)
437 - 1 = 436 / 2 = 218 - 28 = 190/19 = 10 437 = 19 (23) = 19 (20 + 3)
961 - 1 = 960 / 2 = 480 - 46 = 434/31 = 14 961 = 31 (31) = 31 (28 +3)
n(11 n(13 n(17 n(23 n(29 n(31

n(3) n(3) n(5) n(7) ) ) ) n(19) ) ) )
4 7 7 10 16 19 25 28 34 43 46
10 13 12
16 19 17
22 25 24
120
28 31 27
34 37 32
40 43 42 38
46 49 47 45
52 55
58 61 57 59 60
64 67 62 66
70 73 72 71
76 79 77
82 85 80 84
88 91 87
94 97 92 93
100 103 102 101
106 109 107 108 104
112 115 110
118 121 117
124 127 122 126 123
130 133 132 129
136 139 137
142 145 143 144
148 151 147 150 149
154 157 152
160 163 162 159 161
166 169 167 164
172 175 171 170
178 181 177 180
184 187 182 185
190 193 192 188
196 199 197 195
202 205 203 201
208 211 207 206
214 217 212 213
220 223 222 218
226 229 227 225
232 235 234
238 241 237 236 240
244 247 242 245
250 253 252 248
256 259 257 255 258
262 265 263 264
268 271 267 269 266
274 277 272 276 275
280 283 282 279
286 289 287
292 295 290 291 294
298 301 297
121
304 307 302 305

310 313 312 311
316 319 317 318 314
322 325 324
328 331 327
334 337 332 335 333
340 343 342 339
346 349 347 344 348
352 355 353 351
358 361 357 360 356
364 367 362 365
370 373 372 368
376 379 377 374
382 385 381 383
388 391 387 390 389
394 397 392 395 396
400 403 402 401 399
406 409 407 408
412 415
418 421 417 416 420
424 427 422 423 425
430 433 432
436 439 437 434 435
442 445 444
448 451 447 450 446 449
454 457 452 451
460 463 462 458 461
466 469 467 465
472 475 474 471
478 481 477 479 480
484 487 482 481
490 493 492 489
496 499 497 494
122
Object 382
Object 384
And so prime numbers is disposed in three-dimensional space.

123
Object 386
Prime numbers are so fundamental to the working mathematician that any breakthrough in
understanding their nature have a massive impact.
We know today, at the centre of mathematics, the pursuit of order can the men hear sound of
harmony, of the most beautiful music of primes, and we are able to master its twists and turns.
The Riemann Hypothesis had been proved, and we are able, to answering the severity of the
problem of Goldbach to go, whether each grade number as the sum of two primes is represent
able.
If proportionality factor all primes in a given quantity ½ is, but this means that the equation
πx/2πx = ½N/N is the answer to the problem of Goldbach. She says that every even number is
composed of two primes.
Theorem:
If the quotient of quantity prime numbers by its dual quantity, is equal to the quotient of
quantity even numbers by a given magnitude, so in this equation is a proportional relation,
that is, in each equation the product of the inner members equal to the product of outer
members.
Proof: πx/2πx = 2n/N 25/50 = 50/100 = ½

124
Object 388
The proportion of ½ in the case of even numbers means that all even numbers in a block made
up of two primes. 2 + 2 = 4 3 + 3 = 6 3 + 5 = 8 5 + 5 = 10
That is to say 50 even numbers in a block of 100 numbers, is the sum of 4(25) primes, as
shown in the diagram below.
Object 390
How we see on above diagram, sum two prime numbers lies always on parallel straight line to
axis - y and it is even numbers that is consisting with two prime numbers.
125
Object 392
Legitimacy "strong” hypothesis Goldbacha proves legitimacy "weak” hypothesis Goldbacha -

because 3 have will sufficed from given odd larger number since 7 to subtract and to
introduce received even number with strong hypothesis Goldbacha peaceably.
(2n - 1) - 3 = 2n = p + p' → 2n - 1 = p + p + p
Object 394
Also, as you can see, every odd integer greater than 5 is the sum of 3 primes, because the
difference between odd and even numbers always of prime numbers 3 is.
126
Object 396
In addition to the familiar question of whether there are infinitely many prime pairs with
difference 2 there. The six- wide array further helps to demonstrate the otherwise still
unproven conjecture that there must be infinitely many twin primes.
Here are the reasons for this: if there are infinite primes, then twin pairs, with even number
divisible by 3 shares.
Object 398
127
Looking closer at the above graph, you will see that half of the following sums of two primes
on a straight line parallel to the y - axis with real part ½ y lie. This means that the linear
Diophantine equation ax + by - c = 0, with given integer pairs not have common divisor
Coefficient a, b, c, always in prime x, y is solvable.
1(2) + 1(3) – 5 = 0 1(3) + 1(7) – 10 = 0 1(5) + 1(13) – 18 = 0 1(11) + 1(19) – 30 = 0
Still, then, we go on listing to that mysterious prime numbers beat: 2, 3, 5, 7, 11, 13, 17, 19.
The primes stretch out into the far reaches of the universe of numbers, never running dry. Do
we really have to accept that, despite our desire for order and explanation, these fundamental
numbers might forever remain out of reach?
Sale long we reflect upon with perspective Gauß and Riemann’s and we should earlier already
look for different possibilities, to better to get know these full of secrets numbers. The primes
betrayed in end their secret, and remain not an unanswered riddle. I’m who made the primes
sing.
And the primes are for the mathematician is so important that everyone breakthrough a better
understanding of each and its nature is of fundamental importance.
Counting no human invention, because in prime number distribution and the plan of nature, is
encrypted so the whole universe. The number reveals the divine thoughts and Order. It can
also recognize the basic structure of reality. The figure provides some insight into the
innermost mystery of God and the mystery of the world. Who knows a certain number,
possessing power. The counting man accomplishes something similar to God himself, by
ordering power exercises over the things he is different and shares, he delimits and
summarizes.
The reality of the existence of the transcendent blueprint justifies the consideration of whether
is not hidden behind the processes in space and time, so our history, an invisible, transcendent
steering. Thus, because the knowledge is converted to the blueprint into reality, and we are
committed behind the Book of Wisdom 11:21;
"But you have everything sorted by measure, number and weight."
and grasp its profound meaning. The apparent randomness is regulated and thank God that it
need not take at least one million years, until we understand the primes.
There is a widespread belief bordering on certainty that the prime numbers are arranged on
the axis of numerical chaotic, does not govern them apparently no law that would allow us to
clearly describe them all. It is true, that there are 4 known arithmetic sequences which
generate the prime numbers and n-the member is given in clear designs, allowing you
recognize all the prime numbers in a pattern, / p = n (2) + 3 /. We also know that prime
numbers is infinite amount. If you see this let's have similarities as chaos (primes) can
generate the order (the numbers represent the natural order because we can give knowing
antecedent consequent). For the mathematics is obvious that every natural number is a
"combination" of some primes.
Anyone who has read this book to the end, knows why rare beauty and harmony in the world
of numbers there instead of chaos. Finally, we can also live to see the person whose name will
live forever as the mathematician who made the primes sing for the greater glory of God.
FOR THE GREATER GLORY OF GOD.
„AD MAJOREM DEI GLORIAM
SOLI DEO HONOR ET GLORIA.

128
2,3,5,11,13,29, + n(7) = p p(p) + 6(7) = p‘(p“) 7(7) + 6(7) = 13(7) 5(7) + 6(7) = 11(7)
2 3 2n - 1 = k
5 7 11 13 9 15
17 19 23 21 27 25
29 31 37 33 39 35
41 43 47 45 51 49
53 59 61 57 63 55
67 71 73 69 75 65
79 83 81 87 77 85
89 97 93 99 91 95
101 103 107 109 105 111
113 117 123 115 119 121
127 131 129 135 125 133
137 139 141 147 143 145
149 151 157 153 159 155
163 167 165 171 161 169
173 179 181 177 183 175
191 193 189 195 185 187
197 199 201 207 203 205
211 213 219 209 215 217
223 227 229 225 231 221
233 239 241 237 243 235
251 249 255 245 247 253
257 263 261 267 259 265
269 271 277 273 279 275
281 283 285 291 287 289
129
293 297 303 295 299 301

307 311 313 309 315 305
317 321 327 319 323 325
331 337 333 339 329 335
347 349 345 351 341 343
353 359 357 363 355 361
367 373 369 375 365 371
379 383 381 387 377 385
389 397 393 399 391 395
401 409 405 411 403 407
419 421 417 423 413 415
431 433 429 435 425 427
439 443 441 447 437 445
449 457 453 459 451 455
461 463 467 465 471 469
479 477 483 473 475 481
487 491 489 495 485 493
499 503 501 507 497 505
509 513 519 511 515 517
521 523 525 531 527 529
541 537 543 533 535 539
547 549 555 545 551 553
557 563 561 567 559 565
569 571 577 573 579 575
587 585 591 581 583 589
593 599 601 597 603 595
607 613 609 615 605 611
617 619 621 627 623 625
631 633 639 629 635 637
641 643 647 645 651 649
653 659 661 657 663 655
673 669 675 665 667 671
677 683 681 687 679 685
691 693 699 689 695 697
701 709 705 711 703 707
719 717 723 713 715 721
727 733 729 735 725 731
739 743 741 747 737 745
751 757 753 759 749 755
761 769 765 771 763 767
773 777 783 775 779 781
787 789 795 785 791 793
797 801 807 799 803 805
809 811 813 819 815 817
821 823 827 829 825 831
839 837 843 833 835 841
130
853 849 855 845 847 851

857 859 863 861 867 865
877 873 879 869 871 875
881 883 887 885 891 889
897 903 893 895 899 901
907 911 909 915 905 913
919 921 927 917 923 925
929 937 933 939 931 935
941 947 945 951 943 949
953 957 963 955 959 961
967 971 969 975 965 973
977 983 981 987 979 985
991 997 993 999 989 995
1009 1005 1011 1001 1003 1007
1013 1019 1021 1017 1023 1015
1031 1033 1029 1035 1025 1027
1039 1041 1047 1037 1043 1045
1049 1051 1053 1059 1055 1057
1061 1063 1069 1065 1071 1067
1077 1083 1073 1075 1079 1081
1087 1091 1093 1089 1095 1085
1097 1103 1101 1107 1099 1105
1109 1117 1113 1119 1111 1115
1123 1129 1125 1131 1121 1127
1137 1143 1133 1135 1139 1141
1151 1153 1149 1155 1145 1147
1163 1161 1167 1157 1159 1165
1171 1173 1179 1169 1175 1177
1181 1187 1185 1191 1183 1189
1193 1201 1197 1203 1195 1199
1213 1209 1215 1205 1207 1211
1217 1223 1221 1227 1219 1225
1229 1231 1237 1233 1239 1235
1249 1245 1251 1241 1243 1247
1259 1257 1263 1253 1255 1261
1269 1275 1265 1267 1271 1273
1277 1279 1283 1281 1287 1285
1289 1291 1297 1293 1299 1295
1301 1303 1307 1305 1311 1309
1319 1321 1317 1323 1313 1315
1327 1329 1335 1325 1331 1333
1341 1347 1337 1339 1343 1345
1353 1359 1349 1351 1355 1357
1361 1367 1365 1371 1363 1369
1373 1381 1377 1383 1375 1379
1389 1395 1385 1387 1391 1393
131
1399 1401 1407 1397 1403 1405

1409 1413 1419 1411 1415 1417
1423 1427 1429 1425 1431 1421
1433 1439 1437 1443 1435 1441
1447 1451 1453 1449 1455 1445
1459 1461 1467 1457 1463 1465
1471 1473 1479 1469 1475 1477
1481 1483 1487 1489 1485 1491
1493 1499 1497 1503 1495 1501
1511 1509 1515 1505 1507 1513
1523 1521 1527 1517 1519 1525
1531 1533 1539 1529 1535 1537
1543 1549 1545 1551 1541 1547
1553 1559 1557 1563 1555 1561
1567 1571 1569 1575 1565 1573
1579 1583 1581 1587 1577 1585
1597 1593 1599 1589 1591 1595
1601 1607 1609 1605 1611 1603
1613 1619 1621 1617 1623 1615
1627 1629 1635 1625 1631 1633
1637 1641 1647 1639 1643 1645
1657 1653 1659 1649 1651 1655
1663 1667 1669 1665 1671 1661
1677 1683 1673 1675 1679 1681
1693 1689 1695 1685 1687 1691
1697 1699 1701 1707 1703 1705
1709 1713 1719 1711 1715 1717
1721 1723 1725 1731 1727 1729
1733 1741 1737 1743 1735 1739
1747 1753 1749 1755 1745 1751
1759 1761 1767 1757 1763 1765
1777 1773 1779 1769 1771 1775
1783 1787 1789 1785 1791 1781
1801 1797 1803 1793 1795 1799
1811 1809 1815 1805 1807 1813
1823 1821 1827 1817 1819 1825
1831 1833 1839 1829 1835 1837
1847 1845 1851 1841 1843 1849
1861 1857 1863 1853 1855 1859
1867 1871 1873 1869 1875 1865
1877 1879 1881 1887 1883 1885
1889 1893 1899 1891 1895 1897
1901 1907 1905 1911 1903 1909
1913 1917 1923 1915 1919 1921
1931 1933 1929 1935 1925 1927
1941 1947 1937 1939 1943 1945
132
1949 1951 1953 1959 1955 1957

1965 1971 1961 1963 1967 1969
1973 1979 1977 1983 1975 1981
1987 1993 1989 1995 1985 1991
1997 1999 2003 2001 2007 2005
2011 2017 2013 2019 2009 2015
2027 2029 2025 2031 2021 2023
2039 2037 2043 2033 2035 2041
2053 2049 2055 2045 2047 2051
2063 2061 2067 2057 2059 2065
2069 2073 2079 2071 2075 2077
2081 2083 2087 2089 2085 2091
2099 2097 2103 2093 2095 2101
2111 2113 2109 2115 2105 2107
2121 2127 2117 2119 2123 2125
2129 2131 2137 2133 2139 2135
2141 2143 2145 2151 2147 2149
2153 2161 2157 2163 2155 2159
2169 2175 2165 2167 2171 2173
2179 2181 2187 2177 2183 2185
2193 2199 2189 2191 2195 2197
2203 2207 2205 2211 2201 2209
2213 2221 2217 2223 2215 2219
2229 2235 2225 2227 2231 2233
2237 2239 2243 2241 2247 2245
2251 2253 2259 2249 2255 2257
2267 2269 2265 2271 2261 2263
2273 2281 2277 2283 2275 2279
2287 2293 2289 2295 2285 2291
2297 2301 2307 2299 2303 2305
2309 2311 2313 2319 2315 2317
2325 2331 2321 2323 2327 2329
2333 2339 2341 2337 2343 2335
2347 2351 2349 2355 2345 2353
2357 2361 2367 2359 2363 2365
2371 2377 2373 2379 2369 2375
2381 2383 2389 2385 2391 2387
2393 2399 2397 2403 2395 2401
2411 2409 2415 2405 2407 2413
2417 2423 2421 2427 2419 2425
2437 2433 2439 2429 2431 2435
2441 2447 2445 2451 2443 2449
2459 2457 2463 2453 2455 2461
2467 2473 2469 2475 2465 2471
2477 2481 2487 2479 2483 2485
2493 2499 2489 2491 2495 2497
133
2503 2505 2511 2501 2507 2509

2521 2517 2523 2513 2515 2519
2531 2529 2535 2525 2527 2533
2539 2543 2541 2547 2537 2545
2549 2551 2557 2553 2559 2555
2565 2571 2561 2563 2567 2569
2579 2577 2583 2573 2575 2581
2591 2593 2589 2595 2585 2587
2601 2607 2597 2599 2603 2605
2609 2617 2613 2619 2611 2615
2621 2625 2631 2623 2627 2629
2633 2637 2643 2635 2639 2641
2647 2649 2655 2645 2651 2653
2657 2659 2663 2661 2667 2665
2671 2677 2673 2679 2669 2675
2683 2687 2689 2685 2691 2681
2693 2699 2697 2703 2695 2701
2707 2711 2713 2709 2715 2705
2719 2721 2727 2717 2723 2725
2729 2731 2733 2739 2735 2737
2741 2749 2745 2751 2743 2747
2753 2757 2763 2755 2759 2761
2767 2769 2775 2765 2771 2773
2777 2781 2787 2779 2783 2785
2789 2791 2797 2793 2799 2795
2801 2803 2805 2811 2807 2809
2819 2817 2823 2813 2815 2821
2833 2829 2835 2825 2827 2831
2837 2843 2841 2847 2839 2845
2851 2857 2853 2859 2849 2855
2861 2865 2871 2863 2867 2869
2879 2877 2883 2873 2875 2881
2887 2889 2895 2885 2891 2893
2897 2903 2901 2907 2899 2905
2909 2917 2913 2919 2911 2915
2927 2925 2931 2921 2923 2929
2939 2937 2943 2933 2935 2941
2953 2949 2955 2945 2947 2951
2957 2963 2961 2967 2959 2965
2969 2971 2973 2979 2975 2977
2985 2991 2981 2983 2987 2989
2999 3001 2997 3003 2993 2995
3011 3009 3015 3005 3007 3013
3019 3023 3021 3027 3017 3025
3037 3033 3039 3029 3031 3035
3041 3049 3045 3051 3043 3047
134
3061 3057 3063 3053 3055 3059

3067 3069 3075 3065 3071 3073
3079 3083 3081 3087 3077 3085
3089 3093 3099 3091 3095 3097
3109 3105 3111 3101 3103 3107
3119 3121 3117 3123 3113 3115
3129 3135 3125 3127 3131 3133
3137 3141 3147 3139 3143 3145
3153 3159 3149 3151 3155 3157
3163 3167 3169 3165 3171 3161
3181 3177 3183 3173 3175 3179
3187 3191 3189 3195 3185 3193
3203 3201 3207 3197 3199 3205
3209 3217 3213 3219 3211 3215
3221 3229 3225 3231 3223 3227
3237 3243 3233 3235 3239 3241
3251 3253 3249 3255 3245 3247
3257 3259 3261 3267 3263 3265
3271 3273 3279 3269 3275 3277
3285 3291 3281 3283 3287 3289
3299 3301 3297 3303 3293 3295
3307 3313 3309 3315 3305 3311
3319 3323 3321 3327 3317 3225
3329 3331 3333 3339 3335 3337
3343 3347 3345 3351 3341 3349
3359 3361 3357 3363 3353 3355
3371 3373 3369 3375 3365 3367
3381 3387 3377 3379 3383 3385
3389 3391 3393 3399 3395 3397
3407 3405 3411 3401 3403 3409
3413 3417 3423 3415 3419 3421
3433 3429 3435 3425 3427 3431
3441 3447 3437 3439 3443 3445
3449 3457 3453 3459 3451 3455
3461 3463 3467 3469 3465 3471
3477 3483 3473 3475 3479 3481
3491 3489 3495 3485 3487 3493
3499 3501 3507 3497 3503 3505
3511 3517 3513 3519 3509 3515
3527 3529 3525 3531 3521 3523
3533 3539 3541 3537 3543 3535
3547 3549 3555 3545 3551 3553
3557 3559 3561 3567 3563 3565
3571 3573 3579 3569 3575 3577
3581 3583 3585 3591 3587 3589
3593 3597 3603 3595 3599 3601
135
3607 3613 3609 3615 3605 3611

3617 3623 3621 3627 3619 3625
3631 3637 3633 3639 3629 3635
3643 3645 3651 3641 3647 3649
3659 3657 3663 3653 3655 3661
3671 3673 3669 3675 3665 3667
3677 3681 3687 3679 3683 3685
3691 3697 3693 3699 3689 3695
3701 3709 3705 3711 3703 3707
3719 3717 3723 3713 3715 3721
3727 3733 3729 3735 3725 3731
3739 3741 3747 3737 3743 3745
3753 3759 3749 3751 3755 3757
3761 3767 3769 3765 3771 3763
3779 3777 3783 3773 3775 3781
3793 3789 3795 3785 3787 3791
3797 3803 3801 3807 3799 3805
3813 3819 3809 3811 3815 3817
3821 3823 3825 3831 3827 3829
3833 3837 3843 3835 3839 3841
3847 3851 3853 3849 3855 3845
3863 3861 3867 3857 3859 3865
3877 3873 3879 3869 3871 3875
3881 3889 3885 3891 3883 3887
3897 3903 3893 3895 3899 3901
3907 3911 3909 3915 3905 3913
3917 3919 3923 3921 3927 3925
3929 3931 3933 3939 3935 3937
3943 3947 3945 3951 3941 3949
3957 3963 3953 3955 3959 3961
3967 3969 3975 3965 3971 3973
3981 3987 3977 3979 3983 3985
3989 3993 3999 3991 3995 3997
4001 4003 4007 4005 4011 4009
4013 4019 4021 4017 4023 4015
4027 4029 4035 4025 4031 4033
4041 4047 4037 4039 4043 4045
4049 4051 4057 4053 4059 4055
4065 4071 4061 4063 4067 4069
4073 4079 4077 4083 4075 4081
4091 4093 4089 4095 4085 4087
4099 4101 4107 4097 4103 4105
4111 4113 4119 4109 4115 4117
4127 4129 4125 4131 4121 4123
4133 4139 4137 4143 4135 4141
4153 4149 4155 4145 4147 4151
136
4157 4159 4161 4167 4163 4165

4177 4173 4179 4169 4171 4175
4185 4191 4181 4183 4187 4189
4201 4197 4203 4193 4195 4199
4211 4209 4215 4205 4207 4213
4217 4219 4221 4227 4223 4225
4229 4231 4233 4239 4235 4237
4241 4243 4245 4251 4247 4249
4253 4259 4261 4257 4263 4255
4271 4273 4269 4275 4265 4267
4283 4281 4287 4277 4279 4285
4289 4297 4293 4299 4291 4295
4305 4311 4301 4303 4307 4309
4319 4317 4323 4313 4315 4319 4321
4327 4329 4335 4325 4331 4333
4337 4339 4341 4347 4343 4345
4349 4357 4353 4359 4351 4355
4363 4365 4371 4361 4367 4369
4373 4377 4383 4375 4379 4381
4391 4389 4395 4385 4387 4393
4397 4401 4407 4399 4403 4405
4409 4413 4419 4411 4415 4417
4421 4423 4425 4431 4427 4429
4441 4437 4443 4433 4435 4439
4447 4451 4449 4455 4445 4453
4457 4463 4461 4467 4459 4465
4473 4479 4469 4471 4475 4477
4481 4483 4485 4491 4487 4489
4493 4497 4503 4495 4499 4501
4507 4513 4509 4515 4505 4511
4517 4519 4523 4521 4527 4525
4533 4539 4529 4531 4535 4537
4547 4549 4545 4551 4541 4543
4561 4557 4563 4553 4555 4559
4567 4569 4575 4565 4571 4573
4583 4581 4587 4577 4579 4585
4591 4597 4593 4599 4589 4595
4603 4605 4611 4601 4607 4609
4621 4617 4623 4613 4615 4619
4629 4635 4625 4627 4631 4633
4637 4639 4643 4641 4647 4645
4649 4651 4657 4653 4659 4655
4663 4665 4671 4661 4667 4669
4673 4679 4677 4683 4675 4681
4691 4689 4695 4685 4687 4693
4703 4701 4707 4697 4699 4705
137
4713 4719 4709 4711 4715 4717

4721 4723 4729 4725 4731 4727
4733 4737 4743 4735 4739 4741
4751 4749 4755 4745 4747 4753
4759 4761 4767 4757 4763 4765
4773 4779 4769 4771 4775 4777
4783 4787 4789 4785 4791 4781
4793 4799 4801 4797 4803 4795
4813 4809 4815 4805 4807 4811
4817 4821 4827 4819 4823 4825
4831 4837 4833 4839 4829 4835 4837
4845 4851 4841 4843 4847 4849
4861 4857 4863 4853 4855 4859
4871 4869 4875 4865 4867 4873
4877 4881 4887 4879 4883 4885
4889 4893 4899 4891 4895 4897
4903 4909 4905 4911 4901 4907
4919 4917 4923 4913 4915 4921
4931 4933 4929 4935 4925 4927
4937 4943 4941 4947 4939 4945
4951 4957 4953 4959 4949 4955
4967 4969 4965 4971 4961 4963
4973 4977 4983 4975 4979 4981
4987 4991 4993 4989 4995 4985 4991
4999 5003 5001 5007 4997 5005
5009 5011 5013 5019 5015 5017
5021 5023 5025 5031 5027 5029
5033 5039 5041 5037 5043 5033 5035
5047 5051 5049 5055 5045 5047 5053
5059 5061 5067 5057 5063 5065
5077 5073 5079 5069 5071 5075
5081 5087 5085 5091 5083 5089
5099 5101 5097 5103 5093 5095
5107 5113 5109 5115 5105 5111
5119 5121 5127 5117 5123 5125
5133 5139 5129 5131 5135 5137
5147 5145 5151 5141 5143 5149
5153 5157 5163 5155 5159 5161
5167 5171 5169 5175 5165 5173
5179 5181 5187 5177 5183 5185
5189 5197 5193 5199 5191 5195
5209 5205 5211 5201 5203 5207
5217 5223 5213 5215 5219 5221
5227 5231 5233 5229 5235 5225
5237 5241 5247 5239 5243 5245
5253 5259 5249 5251 5255 5257
138
5261 5265 5271 5263 5267 5269

5273 5279 5281 5277 5283 5275
5289 5295 5285 5287 5291 5293
5297 5303 5301 5307 5299 5305
531
5309 5313 5319 5311 5 5317
5323 5325 5331 5321 5327 5329
5333 5337 5343 5335 5339 5341
5347 5351 5349 5355 5345 5353
5361 5367 5357 5359 5363 5365
5373 5379 5369 5371 5375 5377
5381 5387 5385 5391 5383 5389
5393 5399 5397 5403 5395 5401
5407 5413 5409 5415 5405 5411
5417 5419 5421 5427 5423 5425
5431 5437 5433 5439 5429 5435
5441 5443 5449 5445 5451 5447
5457 5463 5453 5455 5459 5461
5471 5469 5475 5465 5467 5473
5477 5479 5483 5481 5487 5485
5493 5499 5489 5491 5495 5497
5501 5503 5507 5505 5511 5509
5519 5521 5517 5523 5513 5515
5527 5529 5535 5525 5533
5541 5547 5537 5539 5543 5545
5557 5553 5559 5549 5551 5555
5563 5569 5565 5571 5561 5567
5573 5581 5577 5583 5575 5579
5591 5589 5595 5585 5587 5593
5601 5607 5597 5599 5603 5605
5613 5619 5609 5611 5615 5617
5623 5625 5631 5621 5627 5629
5639 5641 5637 5643 5633 5635
5647 5651 5653 5649 5655 5645
5657 5659 5661 5667 5633 5665
5669 5673 5679 5671 5675 5677
5683 5689 5685 5691 5681 5687
5693 5701 5697 5703 5695 5699
5711 5709 5715 5705 5707 5713
5717 5721 5727 5719 5723 5725
5737 5733 5739 5729 5731 5735
5741 5743 5749 5745 5751 5747
5757 5763 5753 5755 5759 5761
5769 5775 5765 5767 5771 5773
5779 5783 5781 5787 5777 5785
5791 5793 5799 5789 5795 5797
139
5801 5807 5805 5811 5803 5809

5813 5821 5817 5823 5815 5819
5827 5829 5835 5825 5831 5833
5839 5843 5845 5841 5847 5837 5845
5849 5851 5857 5853 5859 5855
5861 5867 5869 5865 5871 5863
5879 5881 5877 5883 5873 5875
5889 5895 5885 5887 5891 5893
5897 5903 5901 5907 5899 5905
5913 5919 5909 5911 5915 5917
5923 5927 5925 5931 5921 5929
5939 5937 5943 5933 5935 5941
5953 5949 5955 5945 5947 5951
5961 5967 5957 5959 5963 5965
5973 5979 5969 5971 5975 5977
5981 5987 5985 5991 5983 5989
5997 6003 5993 5995 5999 6001
6007 6011 6009 6015 6005 6013
6021 6027 6017 6019 6023 6025
6029 6037 6033 6039 6031 6035
6043 6047 6045 6051 6041 6049
6053 6057 6063 6055 6059 6061
6067 6073 6069 6075 6065 6071
6079 6081 6087 6077 6083 6085
6089 6091 6097 6093 6099 6095 6097
6101 6105 6111 6103 6107 6109
6113 6121 6117 6123 6115 6119
6131 6133 6129 6135 6125 6127
6143 6141 6147 6137 6139 6145
6151 6153 6159 6149 6155 6157
6163 6165 6171 6161 6167 6169
6173 6177 6183 6175 6179 6181
6189 6195 6185 6187 6191 6193
6197 6199 6203 6201 6207 6205
6211 6217 6213 6219 6209 6215
6221 6229 6225 6231 6223 6227
6237 6243 6233 6235 6239 6241
6247 6249 6255 6245 6251 6253
6257 6263 6261 6267 6259 6265
6269 6271 6277 6273 6279 6275
6287 6285 6291 6281 6283 6289
6299 6301 6297 6303 6293 6295
6311 6309 6315 6305 6307 6313
6317 6323 6321 6327 6319 6325
6329 6337 6333 6339 6331 6335
6343 6345 6351 6341 6347 6349
140
6353 6359 6361 6357 6363 6355

6367 6373 6369 6375 6365 6371
6379 6385 6381 6387 6377 6383 6385
6389 6397 6393 6399 6391 6395
6405 6411 6401 6403 6407 6409
6421 6417 6423 6413 6415 6419
6427 6429 6435 6425 6431 6433
6441 6447 6437 6439 6443 6445
6449 6451 6453 6459 6455 6457
6469 6465 6471 6461 6463 6467
6473 6481 6477 6483 6475 6479
6491 6489 6495 6485 6487 6493
6501 6507 6497 6499 6503 6505
6513 6519 6509 6511 6515 6517
6521 6529 6525 6531 6523 6527
6537 6543 6533 6535 6539 6541
6547 6551 6553 6549 6555 6545
6563 6561 6567 6557 6559 6565
6569 6571 6577 6573 6579 6575
6581 6585 6591 6583 6587 6589
6599 6597 6603 6593 6595 6601
6607 6609 6615 6605 6611 6613
6619 6621 6627 6617 6623 6625
6637 6633 6639 6629 6631 6635
6645 6651 6641 6643 6647 6649
6653 6659 6661 6657 6663 6655
6673 6669 6675 6665 6667 6671
6679 6681 6687 6677 6683 6685
6689 6691 6693 6699 6695 6697
6701 6703 6709 6705 6711 6707
6719 6717 6723 6713 6715 6721
6733 6729 6735 6725 6727 6731
6737 6741 6747 6739 6743 6745
6753 6759 6749 6751 6755 6757
6761 6763 6765 6771 6767 6769
6779 6781 6777 6783 6773 6775
6791 6793 6789 6795 6785 6787
6803 6801 6807 6797 6799 6805
6813 6819 6809 6811 6815 6817
6823 6827 6829 6825 6831 6821
6833 6841 6837 6843 6835 6839
6849 6855 6845 6847 6851 6853
6857 6863 6861 6867 6859 6865
6869 6871 6873 6879 6875 6877
6883 6885 6891 6881 6887 6889
6899 6897 6903 6893 6895 6901
141
6907 6911 6909 6915 6905 6913

6917 6921 6927 6919 6923 6925
6933 6939 6929 6931 6935 6937
6947 6949 6945 6951 6941 6943
6959 6961 6957 6963 6953 6955
6967 6971 6969 6975 6965 6973
6977 6983 6981 6987 6979 6985
6991 6997 6993 6999 6989 6995
7001 7005 7011 7003 7007 7009
7013 7019 7017 7023 7015 7021
7027 7029 7035 7025 7031 7033
7039 7043 7041 7047 7037 7045
7057 7053 7059 7049 7051 7055
7069 7065 7071 7061 7063 7067
7079 7077 7083 7073 7075 7081
7089 7095 7085 7087 7091 7093
7103 7101 7107 7097 7099 7105
7109 7113 7119 7111 7115 7117
7121 7127 7129 7125 7131 7123
7137 7143 7133 7135 7139 7141
7151 7149 7155 7145 7147 7153
7159 7161 7167 7157 7163 7165
7177 7173 7179 7169 7171 7175 7177
7187 7185 7191 7181 7183 7189
7193 7197 7203 7195 7199 7201
7207 7211 7213 7209 7215 7205
7219 7221 7227 7217 7223 7225
7229 7237 7233 7239 7231 7235
7243 7247 7245 7251 7241 7249
7253 7257 7263 7255 7259 7261
7269 7275 7265 7267 7271 7273
7283 7281 7287 7277 7279 7285
7297 7293 7299 7289 7291 7295
7301 7303 7307 7309 7305 7311 7301 7303
7321 7317 7323 7313 7315 7319
7331 7333 7329 7335 7325 7327
7341 7347 7337 7339 7343 7345
7349 7351 7353 7359 7355 7357
7369 7365 7371 7361 7363 7367
7377 7383 7373 7375 7379 7381
7393 7389 7395 7385 7387 7391
7401 7407 7397 7399 7403 7405
7411 7417 7413 7419 7409 7415
7425 7431 7421 7423 7427 7429
7433 7437 7443 7435 7439 7441
7451 7449 7455 7445 7447 7453
142
7457 7459 7461 7467 7463 7465

7477 7473 7479 7469 7471 7475
7481 7487 7489 7485 7491 7483
7499 7497 7503 7493 7495 7501
7507 7509 7515 7505 7511 7513
7517 7523 7521 7527 7519 7525
7529 7537 7533 7539 7531 7535
7541 7547 7549 7545 7551 7543
7559 7561 7557 7563 7553 7555
7573 7569 7575 7465 7567 7571
7577 7583 7581 7587 7579 7585
7589 7591 7593 7599 7595 7597
7603 7607 7605 7611 7601 7609
7621 7617 7623 7613 7615 7619
7629 7635 7625 7627 7631 7633
7639 7643 7641 7647 7637 7645
7649 7653 7659 7651 7655 7657
7669 7665 7671 7661 7663 7667
7673 7681 7677 7683 7675 7679
7687 7691 7689 7695 7685 7705 7693
7699 7703 7701 7707 7697 7705
7717 7713 7719 7709 7711 7715
7723 7727 7725 7731 7721 7729
7741 7737 7743 7733 7735 7739
7753 7749 7755 7745 7747 7751
7757 7759 7761 7767 7763 7765
7773 7779 7769 7771 7775 7777
7789 7785 7791 7781 7783 7787
7793 7797 7803 7795 7799 7801
7809 7815 7805 7807 7811 7813
7817 7823 7821 7827 7819 7825
7829 7833 7839 7831 7835 7837
7841 7845 7851 7843 7847 7849
7853 7857 7863 7855 7859 7861
7867 7873 7869 7875 7865 7871
7877 7879 7883 7881 7887 7885
7893 7899 7889 7891 7895 7897
7901 7907 7905 7911 7903 7909
7919 7917 7923 7913 7915 7921
7927 7933 7929 7935 7925 7931
7937 7941 7947 7939 7943 7945
7949 7951 7953 7959 7955 7957
7963 7965 7971 7961 7967 7969
7977 7983 7973 7975 7979 7981
7993 7989 7995 7985 7987 7991
8001 8007 7997 7999 8003 8005
143
8009 8011 8017 8013 8019 8015

8025 8031 8021 8023 8027 8029
8039 8037 8043 8033 8035 8041
8053 8049 8055 8045 8047 8051
8059 8061 8067 8057 8063 8065
8069 8073 8079 8071 8075 8077
8081 8087 8089 8085 8091 8083
8093 8101 8097 8103 8095 8099
8111 8109 8115 8105 8107 8113
8117 8123 8121 8127 8119 8125
8133 8139 8129 8131 8135 8137
8147 8145 8151 8141 8143 8149
8161 8157 8163 8153 8155 8159
8167 8171 8169 8175 8165 8173
8179 8181 8187 8177 8183 8185
8191 8193 8199 8189 8195 8197
8209 8205 8211 8201 8203 8207
8219 8221 8217 8223 8213 8215
8231 8233 8229 8235 8225 8227
8237 8243 8241 8247 8239 8245
8253 8259 8249 8251 8255 8257
8263 8269 8265 8271 8261 8267
8273 8277 8283 8275 8279 8281
8287 8291 8293 8289 8295 8285
8297 8301 8307 8299 8303 8305
8311 8317 8313 8319 8309 8315
8329 8325 8331 8321 8323 8327
8337 8343 8333 8335 8339 8341
8353 8349 8355 8345 8347 8351
8363 8361 8367 8357 8359 8365
8369 8377 8373 8379 8371 8375
8387 8389 8385 8391 8381 8383
8397 8403 8393 8395 8399 8401
8409 8415 8405 8407 8411 8413
8419 8423 8421 8427 8417 8425
8429 8431 8433 8439 8435 8437
8443 8447 8445 8451 8441 8449
8461 8457 8463 8453 8455 8459
8467 8469 8475 8465 8471 8473
8481 8487 8477 8479 8483 8485
8493 8499 8489 8491 8495 8497
8501 8505 8511 8503 8507 8509
8513 8521 8517 8523 8515 8519
8527 8529 8535 8525 8531 8533
8537 8539 8543 8541 8547 8545
8553 8559 8549 8551 8555 8557
144
8563 8565 8571 8561 8567 8569

8573 8581 8577 8583 8575 8579
8589 8595 8585 8587 8591 8593
8597 8599 8601 8607 8603 8605
8609 8613 8619 8611 8615 8617
8623 8627 8629 8625 8631 8621
8641 8637 8643 8633 8635 8639
8647 8649 8655 8645 8651 8653
8663 8661 8667 8657 8659 8665
8669 8677 8673 8679 8671 8675
8681 8689 8685 8691 8683 8687
8693 8699 8697 8703 8695 8701
8707 8713 8709 8715 8705 8711
8719 8721 8727 8717 8723 8725
8731 8737 8733 8739 8729 8735
8741 8747 8745 8751 8743 8749
8753 8761 8757 8763 8755 8759
8769 8775 8765 8767 8771 8773
8779 8783 8781 8787 8777 8785
8793 8799 8789 8791 8795 8797
8803 8807 8805 8811 8801 8809
8819 8821 8817 8823 8813 8815
8831 8829 8835 8825 8827 8833
8837 8839 8841 8847 8843 8845
8849 8853 8859 8851 8855 8857
8861 8863 8867 8865 8871 8869
8877 8883 8873 8875 8879 8881
8887 8893 8889 8895 8855 8891
8901 8907 8897 8899 8903 8905
8913 8919 8909 8911 8915 8917
8923 8929 8925 8931 8921 8927
8933 8941 8937 8943 8935 8939
8951 8949 8955 8945 8947 8953
8963 8961 8967 8957 8959 8965
8969 8971 8973 8979 8975 8977
8985 8991 8981 8983 8987 8989
8999 9001 8997 9003 8993 8995
9007 9011 9013 9009 9015 9005
9021 9027 9017 9019 9023 9025
9029 9033 9039 9031 9035 9037
9041 9043 9049 9045 9051 9047
9059 9057 9063 9053 9055 9061
9067 9069 9075 9065 9071 9073
9081 9087 9077 9079 9083 9085
9091 9093 9099 9089 9095 9097
9103 9109 9105 9111 9101 9107
145
9117 9123 9113 9115 9119 9121

9127 9133 9129 9135 9125 9131
9137 9141 9147 9139 9143 9145
9151 9157 9153 9159 9149 9155
9161 9165 9171 9163 9167 9169
9173 9181 9177 9183 9175 9179
9187 9189 9195 9185 9191 9193
9199 9203 9201 9207 9197 9205
9209 9213 9219 9211 9215 9217
9221 9227 9225 9231 9223 9229
9239 9241 9237 9243 9233 9235
9249 9255 9245 9247 9251 9253
9257 9261 9267 9259 9263 9265
9277 9273 9279 9269 9271 9275
9281 9283 9285 9291 9287 9289
9293 9297 9303 9295 9299 9301
9311 9309 9315 9305 9307 9313
9319 9323 9321 9327 9317 9325
9337 9333 9339 9329 9331 9335
9341 9343 9349 9345 9351 9347
9357 9363 9353 9355 9359 9361
9371 9369 9375 9365 9367 9373
9377 9381 9387 9379 9383 9385
9391 9397 9393 9399 9389 9395
9403 9409 9405 9411 9401 9407
9413 9419 9421 9417 9423 9415
9431 9433 9429 9435 9425 9427
9437 9439 9441 9447 9443 9445
9453 9459 9449 9451 9455 9457
9461 9463 9467 9465 9471 9469
9473 9479 9477 9483 9475 9481
9491 9489 9495 9485 9487 9493
9497 9501 9507 9499 9503 9505
9511 9513 9519 9509 9515 9517
9521 9525 9531 9523 9527 9529
9533 9539 9537 9543 9535 9541
9547 9551 9549 9555 9545 9553
9561 9567 9557 9559 9563 9565
9573 9579 9569 9571 9575 9577
9587 9585 9591 9581 9583 9589
9601 9597 9603 9593 9595 9599
9613 9609 9615 9605 9607 9611
9619 9623 9621 9627 9617 9625
9629 9631 9633 9639 9635 9637
9643 9649 9645 9651 9641 9647
9661 9657 9663 9653 9655 9659
146
9669 9675 9665

9667 9671 9673
9677 9679 9681 9687 9683 9685
9689 9697 9693 9699 9691 9695
9705 9711
9701 9703 9707 9709
9719 9721 9717 9723
9713 9715
9733 9729 9735
9725 9727 9731
9739 9743 9741 9747
9737 9745
9749 9753 9759 9751 9755 9757
9767 9769 9765 9771
9761 9763
9781 9777 9783
9773 9775 9779
9787 9791 9789 9795
9785 9793
9803 9801 9807
9797 9799 9805
9811 9817 9813 9819
9809 9815
9829 9825 9831
9821 9823 9827
9833 9839 9837 9843 9835 9841
9851 9849 9855
9845 9847 9853
9857 9859 9861 9867 9863 9865
9871 9873 9879
9869 9875 9877
9883 9887 9885 9891
9881 9889
9901 9897 9903
9893 9895 9899
9907 9909 9915
9905 9911 9913
9923 9921 9927
9917 9919 9925
9929 9931 9933 9939 9935 9937
9941 9949 9945 9951 9943 9947
9957 9963
9953 9955 9959 9961
9967 9973 9969 9975
9965 9971
9981 9987
9977 9979 9983 9985
9993 9999
9989 9991 9995 9997
1000 1000 1000 1000
7 9 10005 10011 1 3
„We still await the person whose name will live forever as the mathematician who made the
primes sing.” /Marcus du Sautoy THE MUSIC OF THE PRIMES/
Jan Lubina
e-mail: lubinaj7@gmail.com
Personal information
147
I was born in Katowice/Poland on 01.05.1947. Studied theology at the Pontifical Faculty of

Theology in Kraków, so I’m no mathematician, but mathematics has become increasingly
intriguing to me. After decades of self-study of mathematics I find it extremely fascinating.
My work “Apple pie order” presents easy-number theory that is based on prime number 2 and
3. They are also the answer to her as the greatest unsolved classical problems: proof of Fermat
and Goldbach conjuncture, twin primes, Riemann hypothesis and primes distribution.
Object 400
148
149
Or, the title.

A P P L e P I e o R D e R

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

A P P L e P I e o R D e R

Uploaded by

Copyright:

Available Formats

2

"Sed omnia in mensura, et numero, et pondere diposuisti.” Sapientia 11, 21.

Jules Henri Poincaré.

For the memory of

p ±1=2 n 17 + 1 = 18 = 19 – 1 because 3(p −1 )=2 n 3(7-1) =

5 11 17 23 29 41 47 59 71 83 101 107 113 131

In odd numbers the relation of even components to odd is always 2 : 1,

18 + 1 =19= 8(2) + 1(3)

They three numbers create base.

( 2+3 1 ) 1 = ( 2+13 ) 1 = ( 2+13 )

Every plurality is the plurality of „units”.

The pair’s of twin numbers.

106 107 108 109 110 111

nd(pp') 3(q) dr(p) d(p, p') p n(p, p')

11 + 12/3 + 13 17 + 18/3 + 19 29 + 30/3 + 31 2087 + 2088/3 + 2089

All natural numbers congruent to me according to module n’ – n ¿ 0 mod 6.

n n+2 n+6 n+8

25 = 5(2) + 5(3) 5(5) „p“ = n(2 )+n(3) 55 = 11(2) + 11(3) 5(11)

35 = 10(2) + 5(3) 7(5) „p“ = 2 n(2)+n(3 ) 49 = 14(2) + 7(3) 7(7)

119 = 34(2) + 17(3) 7(17) 133 = 38(2) + 19(3) 7(19)

1369 = 1258 + 111 25271 = 23222 + 2049

2 = 1(2) + 0 3 = 0(2) + 3 5=2+3 7 = 2(2) + 3 11 = 4(2) + 3 13 = 5(2) + 3

17 = 7(2) + 3 19 = 8(2) + 3 23 = 10(2) + 3 233 = 115(2) + 3 251 = 124(2) + 3

The natural numbers in scheme of 2 and 3.

2, 3, n(2), 2 + 3, n(3), 3 + n(2), n(2), n(3), n(2), ... n(2) + n(3)

The scheme of natural numbers

Periodical scheme of natural numbers.

So of the sieve Eratosthenes is situated less than 100 numbers 25 primes.

All natural numbers congruent to me according to module.

2n - 1 = 6n - 3 9 = 6(2) - 3 15 = 6(3) - 3 21 = 6(4) - 3 27 = 6(5) - 3 33 = 6(6) -

Table of tens in which prime numbers step out.

I II III IV V VI VII VIII IX X XI XII XIII XIV ..

. I II III IV V VI VII VIII IX X XI XII XIII XIV XV .

p '−1 p−1 p ''+1 p '+1

11 - 3931 and 17 - 4217

13 - 3793 and 19 - 4409

13 23 43 53 73 83 103 113 163 173 193 223

Spiral twelve segmental cycles of primes.

Spiral scheme of natural numbers.

The spiral sequence of natural numbers / primes and almost prime /.

Spiral of almost prime.

Congruence according to module 6 shine numbers with all colors of rainbow.

So looks clocks of primes measuring it in rhythm 2/4 (6).

P(2n) = (p + p’) (2+2) (3 + 3) (3 + 5) (5 + 5) (5 + 7) (7 + 7) (5 + 11) (5 + 13) (7 + 13) (5 + 17)

Fermat’s last theorem.

3(3) + 4(4) = 5(5) [2(5) – 1] + 2(8) = 2(13) – 1 3[2(2) – 1] + 2(2)2(2) = 5[2(3) – 1]

(1+3+5+7+9)25 + (11+13+15+17+19+21+23+25)144 = 169 = 49(1+3+5+7+9+11+13) +

Theorem: The square of hypotenuse is equal the sum of squares of legs,

3[2(2) – 1] + 2(2)2(2) = 5[2(3) – 1]

1 + 3 + 5 = 9 = 3(3) 1 + 3 + 5 + 7 = 16 = 4(4) 1 + 3 + 5 + 7 + 9 = 25 = 5(5)

(1 + 3 + 5) + (1 + 3 + 5 + 7) = (1 + 3 + 5 + 7 +9) Σ(2n - 1) = n(a + z)/2 = n(n)

j^ + a^ = n^ j^ = a^ - n^ = (a + n)(n – a) = j(j) → j² = 1(a + n) j² = n² - a² → j² + a² = n²

13² = (1 + 3 + 5 + 7 + 9 + 11 + 13 + 15 + 17 + 19 + 21 + 23) + (25) = 169 = 25 + 144

25² = 625 = 49 + 576

1 + 3 = 4 + 5 = 9 + 7 = 16 + 9 = 25 + 11 = (36) + 13 = 49 + 15 = (64) + 17 = 81 + 19 = 100 +

j(j) + a(a) = n(n) [L(j)]² + [L(a)]² = [L(n)]²

n(n) (n - a)(n +a) j(j)

52(52) (52 - 48)(52 + 48) 20(20)

2² - 1² = (2 – 1)(2 + 1) = 1(3) 1(1) + 1(3) = 2(2)

3 = (2 – 1)(2 + 1) 5 = (3 – 2)(3 + 2) 7 = (4 – 3)(4 + 3) 11 = (6 – 5)(6 + 5)

13 = (7 – 6)(7 + 6) 17 = (9 – 8)(9 + 8) 19 = (10 – 9)(19 + 9) 23 = (12 – 11)(12 + 11).

1(2) + 1(3) – 5 = 0 1(3) + 1(7) – 10 = 0 1(5) + 1(13) – 18 = 0 1(11) + 1(19) – 30 = 0

Natural numbers, divisibility and primes.

Jules Henri Poincaré.