View Single Post
Old 2021-08-10, 14:20   #1
MattcAnderson's Avatar
"Matthew Anderson"
Dec 2010
Oregon, USA

3F016 Posts
Default I'm into number theory

Hi again all,

You get what you pay for. And I have 3 free Google webpages about mathematics. Some of it is hard to read. Unfortunately, I am unable to make changes to any of these web sites. However, I have backed up this data, and plan to share it another way. I have made a question of this unique at Also, links to the same are in this 'blog'. It involves the function f(n) = n^2+n+41. 41 is one of 6 of Euclid's Euler's Lucky Numbers. My project would not be possible without a computer. Step 1 was make a data table where n is a positive integer. Step 2 was to make a graph of this data. Step 3 was to curve fit (they are all parabolas, said another way, second order polynomials). Also, with a teacher's help I have two easy theorems that help describe this data. The unsolved problem (to mankind) is, assuming n is a positive integer, is f(n) a prime number an infinite number of times?

My leading observation is the pattern of the parabolas. (that doesn't quite make sence). As Michael Penn would say, that is a good place to stop.

Last fiddled with by Dr Sardonicus on 2021-08-10 at 21:09 Reason: Correcting attribution
MattcAnderson is offline   Reply With Quote