Go Back > Extra Stuff > Blogorrhea > MattcAnderson

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

11110000002 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

Thread Tools

Similar Threads
Thread Thread Starter Forum Replies Last Post
Two number theory questions sweety439 Math 0 2020-10-29 18:20
Help with a number theory equivalence lukerichards Number Theory Discussion Group 7 2018-01-29 14:58
Easy number theory. mfgoode Puzzles 2 2006-05-30 09:46
number theory help math Homework Help 2 2004-05-02 18:09
A problem of number theory hyh1048576 Puzzles 0 2003-09-28 15:35

All times are UTC. The time now is 14:08.

Sat Dec 4 14:08:59 UTC 2021 up 134 days, 8:37, 0 users, load averages: 1.53, 1.52, 1.32

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.