That would not bore you with calculations, here is one result.
The minimum error of calculation (E_n - error calculation) will be under the following conditions.
P # +1 = P_n
For example:
2 * 3 +1 = 7 \ 49 * 0,22857142857142857142857142857143-1 = 10.2 \ (15) \ E_4 = 10,2-15 =- 4,8
2 * 3 * 5 + 1 = 31 \ 312 * 145.89 = 0,15285215138898600537040048651775-1 \ (162) \ E_11 = 145,89-162 =- 16,11
2 * 3 * 5 * 7 +1 = 211 \ * 2112 = 4602.57 0,10340224734686314036617469296765-1 \ (4627) \ E_47 =- 24,43
2 * 3 * 5 * 7 * 11 +1 = 2311 23112 * 0,072283275896600550509001872434706-1 = 386043.8 (
More than half a million primes table I have, so that in this example is completed.
And if P # +1 = m, where (m) is not a prime number. Not scary, just to satisfy the condition
P # +1 = P_n
For example:
2 * 3 +1 = 7 \ 49 * 0,22857142857142857142857142857143-1 = 10.2 \ (15) \ E_4 = 10,2-15 =- 4,8
2 * 3 * 5 + 1 = 31 \ 312 * 145.89 = 0,15285215138898600537040048651775-1 \ (162) \ E_11 = 145,89-162 =- 16,11
2 * 3 * 5 * 7 +1 = 211 \ * 2112 = 4602.57 0,10340224734686314036617469296765-1 \ (4627) \ E_47 =- 24,43
2 * 3 * 5 * 7 * 11 +1 = 2311 23112 * 0,072283275896600550509001872434706-1 = 386043.8 (
More than half a million primes table I have, so that in this example is completed.
And if P # +1 = m, where (m) is not a prime number. Not scary, just to satisfy the condition
Sergey Sitnikov
Комментариев нет:
Отправить комментарий