View Single Post
Old 2019-01-13, 13:32   #2
xilman
Bamboozled!
 
xilman's Avatar
 
"π’‰Ίπ’ŒŒπ’‡·π’†·π’€­"
May 2003
Down not across

24×13×53 Posts
Default

Quote:
Originally Posted by BarriaKarl View Post
Hey folks,

some time ago I found (by chance mostly) a quite interesting pattern to find prime numbers. It works quite simply:

We have three functions:

F: P * PE - PE + 1

G: P * (P * PE - PE + 1) - P + 1

H: P * (P * PE - PE + 1) - (P * PE - PE + 1) + 1


P: Prime -- The base prime of our function.
PE: Primo - Error -- A prime number smaller than or equal to P.
E: Error -- Defined as the difference between P and PE.

...

TL;DR: Is it possible to continue this sequence using the 3 functions and the prime number with 8761 digits?
Your notation can be greatly simplified, which may encourage others to look more closely at the sequence. I'll continue you to use your P and PE notation, though they are not particularly standard.

First F can be re-written as (P-1)*PE + 1

G becomes PE * (P-1)2 + 1

and H is PE * (P-1)^2 + P
xilman is offline   Reply With Quote