Rulesof Prime Numbers Rev 2
Rulesof Prime Numbers Rev 2
net/publication/382351847
CITATIONS READS
0 3
1 author:
Takashi Sato
SATOR
40 PUBLICATIONS 125 CITATIONS
SEE PROFILE
All content following this page was uploaded by Takashi Sato on 18 July 2024.
Takashi Sato
July 2024
[email protected]
ABSTRACT
I’m not a mathematician. I’m a designer of innovative next generation nuclear power plants,
iBR/iB1350/SATOR. However, I watched a TV program on prime numbers made by Japanese
NHK. It was interesting. I was interested in rules of prime numbers. So, I devoted some of my
time, around 3 months, to find out rules of prime numbers. The TV program said that Euler went
up the stairs of prime numbers and found no rules but that he found a formula of prime numbers
that converges to 𝜋2/6. It is also said that Gauss also went up the stairs of prime numbers with a
logarithmic table and found some rule. Instead, I found that there are a pair of stairs of prime
numbers. I confirmed that prime numbers appear based on strict rules in each of the stairs of prime
numbers. It is also easily understood how and where twin prime numbers appear. You can find
out a new large prime number based on the rules of prime numbers easier than before.
1. INTRODUCTION
The NHK TV program said that prime numbers appear along with a spiral curve r = a × e
EXP (b × θ). Namely, prime number P is given as follows: P = a × EXP (b × θ). It is also said that
natural phenomena such as a hurricane cloud and an ammonite shell follow a spiral curve of
golden number φ. So, I supposed prime numbers also might appear along with a spiral curve of
golden number φ. The golden number φ is (1 + √5) / 2 = 1.618033989. Then, b = 2/𝜋 × LN(φ) =
0.306348963. 1/b = 3.264251303. a is set to 1. I tried this golden number spiral curve but found
no rules. I also found that the golden number φ = 1.618033989 is close to 𝜋2/6 which is
1.644934067. So, I tried b’ = 2/𝜋 × LN (𝜋2/6) = 0.316845853. 1/b’ = 3.156108845. a is set to 1. I
found no rules again. I found that 1/b and 1/b’ is close to 𝜋. So, I tried 1/b” = 𝜋. b” = 0.316845853.
a is set to 1/𝜋. I found no rules again. So, I concluded that the formula P = a × EXP (b × θ) is not
true.
I used a spreadsheet and a macro that generates prime numbers into column A. Then I
1
Copyright © 2024 Takashi SATO
calculated θr ≝ 1/b x LN(P/a) into column B. I also calculated Δθr into column C. Numbers of
Δθr consist of some sets of similar numbers. However, each similar number decreases slowly and
does not stay constant. This phenomenon appears for all the spiral curves I tried likewise. I also
calculated P/LN(P) like Gauss did into column D up to P = 99991. P/LN(P) is 8685. Height of
stairs at P = 99991 is 9592. The difference is 10.4% for the prime number 99991. So, I didn’t feel
much meaning to calculate P/LN(P) to find out any rules of prime numbers. Owing to a PC and a
spreadsheet, I almost could do what Euler and Gauss did about 300 years ago in about one month.
Then, I supposed that a length L of a spiral curve r = a × EXP (b × θ might correspond to
prime number P, because a spiral chambered seashell of an ammonite grows along L. L from θ =
α to θ = β is given as follows: L = (a × √1 𝑏 / b) × (EXP (b × β) – EXP (b × α)). If L is P – 2
and EXP (b × α) = 2 / a, then θL is given as follows: θL ≝ β = 1 / b x LN ((P – 2) × b / (a ×
√1 𝑏 ) + 2 / a). 2 was selected because 2 is the initial number of prime numbers. I calculated
θL and ΔθL on the spreadsheet. I found that θL is different from θr naturally but that ΔθL is very
close to Δθr. ΔθL also consist of some sets of similar numbers. However, each similar number
decreases slowly and does not stay constant.
Then I came up with an idea to calculate ΔθS stepwise and directly from Pn to Pn+1. ΔθS ≝
β = 1 / b × LN ((Pn+1 – Pn) × b / (a × √1 𝑏 ) + 2 / a). This is a very unique idea because
difference between Pn+1 – Pn is calculated as a length from 2 which is the initial number of prime
numbers. I calculated ΔθS using the formula on the spreadsheet. Finally, I found a rule that ΔθS
consist of some sets of constant numbers. Each number stays constant exactly up to 10 digits
which are the upmost digits the spreadsheet allows. I also confirmed that Pn+1 – Pn consist of some
sets of different constant numbers even if calculated as a length from 1.
Then I noticed that if ΔθS consist of some sets of constant numbers, then Pn+1 – Pn must also
consist of some sets of constant numbers, because Pn+1 – Pn = (a × √1 𝑏 / b) × (EXP (b × ΔθS)
– 2/a). I calculated Pn+1 – Pn on the spreadsheet directly not using the formula. I found a rule that
Pn+1 – Pn consist of some sets of even numbers such as 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 34, 36,
38, 40, 52, 54, 58. It seems that these even numbers appear at random. That means prime numbers
seem to appear at random. This rule of prime numbers has nothing to do with the logarithmic
spiral curves that the TV program implied and I tried. This is the first conclusion that I made.
Prime numbers seem to appear at random but differences of prime numbers are always
even numbers. Exception is only the difference between 3 and 2 which is 1. Maybe 2 is not a
true prime number. 2 is rather a basic number of even numbers. 3 might not be a true prime number,
either. 3 is rather a basic number of multiples of 3. True prime numbers start from 5. True prime
numbers are always odd numbers that cannot be divided by 2 or 3. I considered that true prime
numbers appear based on certain rules and not at random.
2
Copyright © 2024 Takashi SATO
2. REASON FOR EVEN NUMBERS
True prime numbers that start from 5 are always odd numbers. The differences between true
prime numbers are always even umbers. From now on I call true prime numbers just prime
numbers for convenience. Namely, the differences between prime numbers are always even
numbers. Adding an even number to a prime number may generate another prime number. On the
contrary, adding an odd number to a prime number never generates another prime number. If an
odd number is divided by 2 the remainder is 1. Therefore, adding two odd numbers always
generates an even number. MOD (an odd number, 2) is 1. MOD (another odd number, 2) is also
1. Therefore, MOD (an odd number, 2) + MOD (another odd number, 2) is 2 which is divisible
by 2. Then an odd number + another odd number is always divisible by 2, namely, an even number.
As prime numbers are odd numbers, adding an odd number to a prime number always generates
an even number which is not a prime number. Therefore, a difference between prime numbers
must be an even number.
3. GENES OF ADDITION
Japanese NHK also provided a TV program on abc conjecture. In the program, it was
explained that multiplication is easy but that addition is difficult. In multiplication of a x b = c,
genes, prime factors, of a and b are maintained in c. In addition of a + b = c, however, genes,
prime factors, of a and b are not maintained in c and c has quite different prime factors. It is
explained that prediction of prime factors of c in addition is difficult in advance.
I, however, thought that prediction of prime factors of c in addition was somewhat possible
in advance. Genes of a and b in addition are remainders of a and b when divided by a prime
number. For example, in addition of 7 + 15 = 22, MOD (7, 2) = 1 and MOD (15, 2) = 1. Then
MOD (MOD (7, 2) + MOD (15, 2), 2) = 0. Therefore, 2 is predicted to be a prime factor of 22 in
advance. MOD (7, 11) = 7 and MOD (15, 11) = 4. MOD (MOD (7, 11) + MOD (15, 11), 11) = 0.
Therefore, 11 is also predicted to be a prime factor of 22 in advance. “in advance” means when c
is not calculated yet. Namely, you can know prime factors of c before c is calculated.
There is another example of addition of 4 + 21 = 25. MOD (4, 5) = 4 and MOD (21, 5) = 1.
MOD (MOD (4, 5) + MOD (21, 5), 5) = 0. Therefore, 5 is predicted to be a prime factor of 25 in
advance. In this case, however, it is difficult to predict another 5 is also a prime factor of 25.
Basically, MOD calculation can predict rad (c) in addition. If c is a prime number MOD
calculation is not so much effective because rad (c) = c in this case. I suppose this information
might be useful to prove abc conjecture somewhat easier.
4. A PAIR OF STAIRS
Prime numbers are odd numbers that must not be divisible by 3. Therefore, MOD (a prime
3
Copyright © 2024 Takashi SATO
number, 3) 0. Based on MOD calculation, to keep this rule, difference of prime numbers must
be a multiple of 3, namely MOD (difference of prime numbers, 3) must be 0. Suppose a is a
prime number, b is a difference, c is another prime number and a + b = c. If MOD (a, 3) 0 and
MOD (b, 3) = 0, then MOD (a, 3) + MOD (b, 3) 0. Therefore, MOD (c, 3) 0. Difference
of prime numbers also must be an even number that is a multiple of 2. Therefore, the minimum
difference of prime numbers must be 2 x 3 = 6.
If a prime number starts from 5, subsequent numbers are 11, 17, 23, 29, 35, 41, 47. I call this
sequence 5-sequence. If a prime number starts from 7, subsequent numbers are 13, 19, 25, 31, 37,
43, 49. I call this sequence 7-sequence. Both sequences include not only prime numbers but also
composite numbers of the prime numbers.
5-sequence is 6 x n – 1. n = 1, 2, 3, ….. ∞.
7-sequence is 6 x m + 1. m = 1, 2, 3, ….. ∞.
4
Copyright © 2024 Takashi SATO
You can notice that 5-sequence and 7-sequence are twin sequences with difference of 2. This
is the reason why twin prime numbers appear. If both numbers in the same row are prime numbers,
then they become twin prime numbers. If at least one of the numbers in the same row is not a
prime number, they do not become twin prime numbers. You can also notice that there is a pair
of stairs. Euler and Gauss went up only one set of stairs where 5-sequence and 7-sequence are
mixed up and found no rules. I, however, go up a pair of stairs separately where certain rules of
prime numbers exist.
You can notice that 5-sequence connects with 7-sequence in the negative region. You can also
notice that 7-sequence connects with 5-sequence in the negative region. This is very interesting.
While 5-sequence and 7-sequence seem to be different sequences, they connect with each other
in the negative region and show a perfect symmetric property. At n, m = 0, there are 1 and – 1.
5
Copyright © 2024 Takashi SATO
However, they are not prime numbers. They are pivot numbers connecting and switching the
symmetric sequences. 1 is a remainder of 7-sequence numbers divided by 3. For example, MOD
(7, 3) = 1. On the contrary, a remainder of 5-sequence numbers divided by 3 is 2. For example,
MOD (5, 3) = 2. This is because 5 = 1 × 3 +2. The remainder is 2. However, here is another
expression, 5 = 2 × 3 – 1. In this expression, – 1 is not a remainder but a debt to make 5 to 6.
Therefore, I call – 1 a debt in this expression and use a sign of DET (5, 3) = – 1. – 1 is a debt of
5-sequence numbers.
You can notice that 2 and 3 do not appear in 5-sequence and 7-sequence. This is because 2
and 3 are not true prime numbers. 2 is a basic number of even numbers that are multiples of 2. 3
is also a basic number of multiples of 3. I designate multiples of 3 as triven numbers. I also
designate a sequence of even numbers as 2-sequence and a sequence of triven numbers as 3-
sequence.
2-sequence is 2 × n. n = 1, 2, 3, ….. ∞.
3-sequence is 6 × n – 3. n = 1, 2, 3, ….. ∞.
You can generate both sequences on a spreadsheet as follows:
n 2-sequece 3-sequece
1 2 3
2 4 9
3 6 15
4 8 21
5 10 27
6 12 33
7 14 39
8 16 45
9 18 51
10 20 57
11 22 63
12 24 69
13 26 75
14 28 81
15 30 87
16 32 93
17 34 99
18 36 105
19 38 111
20 40 117
6
Copyright © 2024 Takashi SATO
The difference of 2-sequence numbers is 2. However, the difference of 3-sequence numbers is not
3 but 6. This is the same reason why 5-sequence numbers and 7-sequence numbers both have the
difference of 6 (See the first paragraph of Section 4.).
Both even numbers and triven numbers do not include prime numbers larger than 3.
Therefore, you need to screen out at first even numbers (2-seaquence) and triven numbers (3-
sequence) to find out rules of prime numbers larger than 3. Euler and Gauss included even
numbers and triven numbers into their stairs and found that prime numbers appear at random.
However, this is not true. Prime numbers larger than 3 appear only in 5-sequence and 7-sequence.
If you look at only 5-sequence and 7-sequence you can find out rules of prime numbers.
5-sequence and 7-sequence consist of prime numbers larger than 3 and composite numbers
of the prime numbers. I designate them as priven numbers. Prime factors of priven numbers are
always prime numbers larger than 3 which I call true prime numbers.
7
Copyright © 2024 Takashi SATO
Prime number 11 also goes up the 5-sequence stairs with 11 steps constantly. 11 appears at
sequence numbers n = 2, 13, 24, 35……., 200 at intervals of11, making composite numbers 77 =
11 × 7, 143 = 11 × 13, 209 = 11 × 19, ……..., 1199 = 11 × 109. Up to 77 there is no composite
numbers made of 11. However, there is 65 = 13 x 5 that is a composite number of 13. Therefore,
based on the Rule 1, 5-sequence numbers between 35 and 77 must be all new prime numbers
except 65. They are 41, 47, 53, 59, 71.
Prime number 17 also goes up the 5-sequence stairs with 17 steps constantly. 17 appears at
sequence numbers n = 3, 20, 37, 54……., 190 at intervals of 17, making composite numbers 119
= 17 × 7, 221 = 17 × 13, 323 = 17 × 19, ……..., 1139 = 17 × 67. Up to 119 there is no composite
numbers made of 17. However, there is 95 = 19 × 5 that is a composite number of 19. Therefore,
based on the Rule 1, 5-sequence numbers between 77 and 119 must be all new prime numbers
except 95. They are 83, 89, 101, 107, 113.
Prime number 7 also goes up the 7-sequence stairs with 7 steps constantly. 7 appears at
sequence numbers m = 1, 8, 15, 22……., 197 at intervals of 7, making composite numbers in 7-
sequence 49 = 7 × 7, 91 = 7 × 13, 133 = 7 × 19, ……..., 1183 = 7 × 169. Up to 49 there is no
composite numbers made of 7. However, there is 25 = 5 × 5 that is a composite number of 5.
Therefore, based on the Rule 1, 7-sequence numbers less than 49 must be all new prime numbers
except 25. They are 7, 13, 19, 31, 37, 43.
Prime number 13 also goes up the 7-sequence stairs with 13 steps constantly. 13 appears at
sequence numbers m = 2, 15, 28, 41……., 197 at intervals of 13, making composite numbers in
7-sequence 91 = 13 × 7, 169 = 13 × 13, 247 = 13 × 19, ……..., 1183 = 13 × 91. Up to 91 there is
no composite numbers made of 13. However, there is 55 = 5 × 11 and 85 = 5 × 17 that are
composite numbers of 5. Therefore, based on the Rule 1, 7-sequence numbers between 49 and 91
must be all new prime numbers except 55 and 85. They are 61, 67, 73, 79.
In general, if prime number P5 that is 5-sequence number appears at sequence number n = n0,
then composite numbers of P5 appear in 5-sequence at sequence numbers n = P5 × i + n0, where i
= 1, 2, 3, …… ∞.
In general, if prime number P7 that is 7-sequence number appears at sequence number m =
m0, then composite numbers of P7 appear in 7-sequence at sequence numbers m = P7 × i + m0,
where i = 1, 2, 3, …… ∞.
Rule 3. Prime number P in the other side sequence also goes up this side sequence with P
steps.
For example, 7 is a prime number of 7-sequence. However, 7 also appears in 35 = 5 × 7 in
5-sequence. Then 7 goes up 5-sequence stairs with 7 steps. 7 appears in 5-sequence at sequence
8
Copyright © 2024 Takashi SATO
numbers n = 6, 13, 20, 27, ……195 at intervals of 7, making composite numbers 35 = 7 × 5, 77
= 7 × 11, 119 = 7 × 17, 161 = 7 × 23, …….., 1169 = 7 × 167.
For another example, 5 is a prime number of 5-sequence. However, 5 also appears in 25 = 5
× 5 in 7-sequence. Then 5 goes up 7-sequence stairs with 5 steps. 5 appears in 7-sequence at
sequence numbers m = 4, 9, 14, 19, ……199 at intervals of 5, making composite numbers 25 = 5
× 5, 55 = 5 × 11, 85 = 5 × 17, 115 = 5 × 23, …….., 1195 = 5 × 239.
For yet another example, 13 is a prime number of 7-sequence. However, 13 also appears in
65 = 5 × 13 in 5-sequence. Then 13 goes up 5-sequence stairs with 13 steps. 13 appears in 5-
sequence at sequence numbers n = 11, 24, 37, 50, ……193 at intervals of 13, making composite
numbers 65 = 13 × 5, 143 = 13 × 11, 221 = 13 × 17, 299 = 13 × 23, …….., 1157 = 13 × 89.
For one more example, 11 is a prime number of 5-sequence. However, 11 also appears in 55
= 5 × 11 in 7-sequence. Then 11 goes up 7-sequence stairs with 11steps. 11 appears in 7-sequence
at sequence numbers m = 9, 20, 31, 42, ……199 at intervals of 11, making composite numbers
55 = 11 × 5, 121 = 11 × 11, 187 = 11 × 17, 253 = 11 × 23, …….., 1177 = 11 × 107.
In general, if prime number P5 that is 5-sequence number appears at sequence number n = n0,
then composite numbers of P5 appear in 7-sequence at sequence numbers m = P5 × i – n0, where
i = 1, 2, 3, …… ∞.
In general, if prime number P7 that is 7-sequence number appears at sequence number m =
m0, then composite numbers of P7 appear in 5-sequence at sequence numbers n = P7 × i – m0,
where i = 1, 2, 3, …… ∞.
The above rules 1, 2, 3 of prime numbers are very strict. There is no exception. All prime
numbers go up the twin stairs with their own constant P steps making composite numbers based
on the strict rules in 5-sequence and 7-sequence. A new prime number appears where composite
numbers of known prime numbers cannot make it.
As a matter of fact, composite numbers also follow the rules 2 and 3. For example, 35 appears
at sequence number n = 6 in 5-sequence. Therefore, based on the rule 2, the next composite
number that includes 35 appears at sequence number n= 35 × 1 + 6 = 41. That is 245 = 7 × 35.
The next composite number that includes 35 appears at sequence number n= 35 × 2 + 6 = 76. That
is 455 = 13 × 35. For another example, 25 appears at sequence number m = 4 in 7-sequence.
Therefore, based on the rule 3, the next composite number that includes 25 appears at sequence
number n = 25 × 1 – 4 = 21 in 5-sequence. That is 125 = 5 × 25. The next composite number that
includes 25 appears at sequence number n = 25 × 2 – 4 = 46 in 5-sequence. That is 275 = 11 × 25.
It is a miracle of number theory. However, as composite numbers are composed of prime numbers,
9
Copyright © 2024 Takashi SATO
you don’t have to worry about them. You only have to watch prime numbers. 5-sequence and 7-
sequence are twin sequences that generate prime numbers strictly based on the rules 1, 2, 3. It is
a super miracle of number theory that I found.
TABLE I shows 5-sequence and 7-sequence up to 200 rows. P designates prime numbers. T
designates twin prime numbers. If you want more numbers, you can easily generate them on your
spreadsheet by yourself. 5-sequence is 6n – 1, and 7-sequence is 6m + 1, where n and m are
sequence numbers, 1, 2, 3,…… ∞. 5-seaquence and 7-sequence are twin sequences. Prime
numbers appear strictly based on the Rules 1, 2, 3. You can see how and where prime numbers
appear. You can also understand how and where twin prime numbers appear.
TABLE I
Numbers in 5-sequence and 7-sequence
n 5-Sequence 6n-1 m 7-Sequence 6m+1 twin
1 5 P 1 7 P T
2 11 P 2 13 P T
3 17 P 3 19 P T
4 23 P 4 25 5x5
5 29 P 5 31 P T
6 35 5x7 6 37 P
7 41 P 7 43 P T
8 47 P 8 49 7x7
9 53 P 9 55 5x11
10 59 P 10 61 P T
11 65 5x13 11 67 P
12 71 P 12 73 P T
13 77 7x11 13 79 P
14 83 P 14 85 5x17
15 89 P 15 91 7x13, 13x7
16 95 5x19 16 97 P
17 101 P 17 103 P T
18 107 P 18 109 P T
19 113 P 19 115 5x23
20 119 17x7 20 121 11x11
21 125 5x25, 5^3 21 127 P
10
Copyright © 2024 Takashi SATO
n 5-Sequence 6n-1 m 7-Sequence 6m+1 twin
22 131 P 22 133 7x19
23 137 P 23 139 P T
24 143 13x11 24 145 5x29
25 149 P 25 151 P T
26 155 5x31 26 157 P
27 161 7x23 27 163 P
28 167 P 28 169 13x13
29 173 P 29 175 7x25, 5x35
30 179 P 30 181 P T
31 185 5x37 31 187 11x17
32 191 P 32 193 P T
33 197 P 33 199 P T
34 203 7x29 34 205 5x41
35 209 11x19 35 211 P
36 215 5x43 36 217 7x31
37 221 17x13 37 223 P
38 227 P 38 229 P T
39 233 P 39 235 5x47
40 239 P 40 241 P T
41 245 7x35 41 247 13x19
42 251 P 42 253 11x23
43 257 P 43 259 7x37
44 263 P 44 265 5x53
45 269 P 45 271 P T
46 275 11x25, 5x55 46 277 P
47 281 P 47 283 P T
48 287 7x41 48 289 17x17
49 293 P 49 295 5x59
50 299 13x23 50 301 7x43
51 305 5x61 51 307 P
52 311 P 52 313 P T
53 317 P 53 319 11x29
54 323 17x19 54 325 5x65, 13x25
55 329 7x47 55 331 P
11
Copyright © 2024 Takashi SATO
n 5-Sequence 6n-1 m 7-Sequence 6m+1 twin
56 335 5x67 56 337 P
57 341 11x31 57 343 7x49, 7^3
58 347 P 58 349 P T
59 353 P 59 355 5x71
60 359 P 60 361 19x19
61 365 5x73 61 367 P
62 371 7x53 62 373 P
63 377 13x29 63 379 P
64 383 P 64 385 7x55, 5x77
65 389 P 65 391 17x23
66 395 5x79 66 397 P
67 401 P 67 403 13x31
68 407 11x37 68 409 P
69 413 7x59 69 415 5x83
70 419 P 70 421 P T
71 425 25x17 71 427 7x61
72 431 P 72 433 P T
73 437 19x23 73 439 P
74 443 P 74 445 5x89
75 449 P 75 451 11X41
76 455 7x65, 13x35 76 457 P
77 461 P 77 463 P T
78 467 P 78 469 7x67
79 473 11x43 79 475 5x95, 5x5x19
80 479 P 80 481 13x37
81 485 5x97 81 487 P
82 491 P 82 493 17x29
83 497 7x71 83 499 P
84 503 P 84 505 5x101
85 509 P 85 511 7x73
86 515 5x103 86 517 11x47
87 521 P 87 523 P T
88 527 17x31 88 529 23x23
89 533 13x41 89 535 5x107
12
Copyright © 2024 Takashi SATO
n 5-Sequence 6n-1 m 7-Sequence 6m+1 twin
90 539 7x77, 11x49 90 541 P
91 545 5x109 91 547 P
92 551 19x29 92 553 7x79
93 557 P 93 559 13x43
94 563 P 94 565 5x113
95 569 P 95 571 P T
96 575 5x115, 23x25 96 577
97 581 7x83 97 583 11x53
98 587 P 98 589 19x31
99 593 P 99 595 7x85, 5x119
100 599 P 100 601 P T
101 605 11x55 101 607 P
102 611 13x47 102 613 P
103 617 P 103 619 P T
104 623 7x89 104 625 5x125, 5^4
105 629 17x37 105 631 P
106 635 5x127 106 637 7x91
107 641 P 107 643 P T
108 647 P 108 649 11x59
109 653 P 109 655 5x131
110 659 P 110 661 P T
111 665 7x95 111 667 23x29
112 671 11x61 112 673 P
113 677 P 113 679 7x97
114 683 P 114 685 5x137
115 689 13x53 115 691 P
116 695 5x139 116 697 17x41
117 701 P 117 703 19x37
118 707 7x101 118 709 P
119 713 23x31 119 715 5x11x13, 13x55
120 719 P 120 721 7x103
121 725 5x5x29 121 727 P
122 731 17X43 122 733 P
123 737 11x67 123 739 P
13
Copyright © 2024 Takashi SATO
n 5-Sequence 6n-1 m 7-Sequence 6m+1 twin
124 743 P 124 745 5X149
125 749 7x107 125 751 P
126 755 5x151 126 757 P
127 761 P 127 763 7x109
128 767 13x59 128 769 P
129 773 P 129 775 5X155, 5X5X31
130 779 19x41 130 781 11X71
131 785 5x157 131 787 P
132 791 7x113 132 793 13X61
133 797 P 133 799 17X47
134 803 11x73 134 805 7x115, 5x161
135 809 P 135 811 P T
136 815 5x163 136 817 19X43
137 821 P 137 823 P T
138 827 P 138 829 P T
139 833 7x119 139 835 5X167
140 839 P 140 841 29X29
141 845 5x169, 5x13^ 141 847 7x121
142 851 23x37 142 853 P
143 857 P 143 859 P T
144 863 P 144 865 5X173
145 869 11x79 145 871 13X67
146 875 7x125 146 877 P
147 881 P 147 883 P T
148 887 P 148 889 7x127
149 893 19x47 149 895 5X179
150 899 29x31 150 901 17X53
151 905 5x181 151 907 P
152 911 P 152 913 11X83
153 917 7x131 153 919 P
154 923 13x71 154 925 5X185, 5X5X37
155 929 P 155 931 7x133
156 935 11x85 156 937 P
157 941 P 157 943 23X41
14
Copyright © 2024 Takashi SATO
n 5-Sequence 6n-1 m 7-Sequence 6m+1 twin
158 947 P 158 949 13X73
159 953 P 159 955 5X191
160 959 7x137 160 961 31X31
161 965 5x193 161 967 P
162 971 P 162 973 7x139
163 977 P 163 979 11X89
164 983 P 164 985 5X197
165 989 23x43 165 991 P
166 995 5x199 166 997 P
167 1001 7x143, 11x91 167 1003 17X59
168 1007 19x53 168 1009 P
169 1013 P 169 1015 5x203, 7x145
170 1019 P 170 1021 P T
171 1025 5x205, 25x41 171 1027 13X79
172 1031 P 172 1033 P T
173 1037 17x61 173 1039 P
174 1043 7x149 174 1045 19x55, 5x209
175 1049 P 175 1051 P T
176 1055 5x211 176 1057 7x151
177 1061 P 177 1063 P T
178 1067 11x97 178 1069 P
179 1073 29X37 179 1075 5X215, 5X5X43
180 1079 29x37 180 1081 23X47
181 1085 7x155 181 1087 P
182 1091 P 182 1093 P T
183 1097 P 183 1099 7x157
184 1103 P 184 1105 5x221
185 1109 P 185 1111 11X101
186 1115 5x223 186 1117 P
187 1121 19x51 187 1123 P
188 1127 7x161 188 1129 P
189 1133 11x103 189 1135 5x227
190 1139 17x67 190 1141 7x163
191 1145 5x229 191 1147 31X37
15
Copyright © 2024 Takashi SATO
n 5-Sequence 6n-1 m 7-Sequence 6m+1 twin
192 1151 P 192 1153 P T
193 1157 13x89 193 1159 19X61
194 1163 P 194 1165 5x233
195 1169 7x167 195 1171 P
196 1175 5x235, 25x47 196 1177 11X107
197 1181 P 197 1183 7x169, 13x91
198 1187 P 198 1189 29X41
199 1193 P 199 1195 5x239
200 1199 11x109 200 1201 P
5-sequence and 7-sequence are twin sequences. Where n = m, namely, in the same row in
TABLE I, 5-sequence number and 7-sequence number are always twin numbers. If both 5-
sequence number and 7-sequence number in the same row are prime numbers, then they are twin
prime numbers. The reason why twin prime numbers appear is very simple. However, if you go
up the stairs of prime numbers including all the integers as Euler and Gauss did, you cannot
understand how and where twin prime numbers appear.
16
Copyright © 2024 Takashi SATO
for every P7 over mL, where mC are sequence numbers of composite numbers, P7 is known prime
numbers of 7-sequence, m0 is sequence number of P7, i = 1, 2, 3, ……. ∞. Then also calculate
sequence number mC = P5 × i – n0 for every P5 over mL, where mC are sequence numbers of
composite numbers, P5 is known prime numbers of 5-sequence, n0 is sequence number of P5, i =
1, 2, 3, …… .∞. If you find a sequence number mN that is not equal to mC, then P7N = 6 × mN + 1
is a new prime number of 7-sequence. You can repeat this process indefinitely and you can find a
new prime number of 7-sequence indefinitely.
Using 5-sequence and 7-sequence and based on the Rules 1, 2, 3, you can find new large
prime numbers easier than before. Firstly, even numbers and triven numbers are eliminated. You
only have to watch priven numbers. Priven numbers are divided into 5-sequence and 7-sequence.
Priven numbers appear at intervals of 6 in each sequence. You only have to watch numbers at
intervals of 6. You don’t have to check all the integers as Euler and Gauss did. You don’t have to
divide all the priven numbers by each known prime numbers to find a new prime number. Instead,
you only have to calculate nC and mC for each known prime number P by simple multiplication
of P × i. Although calculation is simple, there are huge number of known prime numbers.
Therefore, you might need a simple computer program and a computer that can treat very long
digits.
17
Copyright © 2024 Takashi SATO
n* = 1, 2, 3, ……∞, sequence number of C(N(n)) in 5-sequence
n” = 1, 2, 3, ……∞, sequence number of C(M(m)) in 5-sequence
n0= 1, 2, 3, ……∞, sequence number of 5-sequence, part of n
m0=1, 2, 3, ……∞, sequence number of 7-sequence, part of m
i = 1, 2, 3, ……∞, a counter of jumping of N(n0) and M(m0)
As a matter of fact, S5(C(M(m))) and S5(C(N(n))) have a common section. Therefore, the above
formula is not precisely correct. The above formula is simplified to neglect the common section.
8. STRUCTURE OF INTEGERS
At first, prime numbers appeared. Then composite numbers of the prime numbers appeared.
Priven numbers were completed. Even numbers appeared as differences of priven numbers. So,
what for triven numbers? Triven numbers seem useless as a number group. Triven numbers,
however, connect the string of integers.
Triven numbers are 6 × n - 3, where n = 1, 2, 3,……. ∞. However, triven numbers 9 can
be expressed as 6 × n + 3, where n = 1, 2, 3,…….∞. Even numbers are 2 × n, where n = 1, 2,
3,……. ∞. However, even numbers 6 also can be divided into 6 × n, 6 × n +2, 6 × n + 4 where
n = 1, 2, 3,……. ∞. Namely, even numbers can be divided into three groups, A, B, C. MOD (A,
6) = 0, MOD (B, 6) = 2, and MOD (C, 6) = 4. Numbers of A, B, C are as follows:
18
Copyright © 2024 Takashi SATO
n A B C
6×n 6×n+2 6×n+4
1 6 8 10
2 12 14 16
3 18 20 22
4 24 26 28
5 30 32 34
19
Copyright © 2024 Takashi SATO
As you can see, integers repeat 5A7BTC arrangement forever. Integers have structure of
5A7BTC5A7BTC5A7BTC5A7BTC…….∞. Triven numbers seem to be useless. Triven numbers,
however, work to connect the string of integers. Prime numbers appear only in 5-sequence and 7-
sequence. Therefore, you need to screen out A, B, C and T from the string of integers at first to
understand the Rules of prime numbers.
Then you can get a string of 5757575757575757575757…….∞. It includes pure gold of
prime numbers.
9. CONCLUSIONS
Prime numbers have nothing to do with a logarithmic spiral curve. Prime numbers seemed
to appear at random on the stairs of prime numbers Euler and Gauss went up. However, prime
numbers appear strictly based on the Rules 1, 2, 3 of prime numbers. In order to understand the
Rules of prime numbers, you need to screen out even numbers and triven numbers at first because
they don’t include prime numbers larger than 3. The rest of numbers are priven numbers. Prime
numbers lager than 3 are all included in priven numbers. Then, you need to divide priven numbers
into 5-sequence and 7-sequence. There are not one but two sets of stairs of prime numbers. It is a
miracle to find that each prime number P goes up the two sets of stairs with constant P steps and
makes a composite number of P. A new prime number appears where known prime numbers
cannot make a composite number. 5-sequence numbers and 7-sequence numbers are connected to
each other very strongly not only in the negative region but also in the positive region to make
composite numbers. They are twin sequences and cannot exist without each other. In order to
make composite numbers in this side sequence, prime numbers in the other side sequence must
be used. This is very interesting. Although 5-sequence and 7-sequence seem different to each
other, they might be the same sequence in most depth of number world. Prime numbers appear in
5-sequence and 7-sequence strictly based on the Rules 1, 2, 3. You can also easily understand how
and where twin prime numbers appear in the twin sequences.
Revision History
SATOR-2024-001 Rev.1 corrected typos in author’s name and e-mail address. Added title rows
on each page of TABLE1.
20
Copyright © 2024 Takashi SATO