![]() |
![]() |
#1 |
Just call me Henry
"David"
Sep 2007
Liverpool (GMT/BST)
37·163 Posts |
![]()
I saw this webpage http://109.90.219.147/devalco/basic_polynoms/ and thought that people might be interested in finding polynomials with higher prime density. He has found some rules on what makes a good poly. Can we find some more?
|
![]() |
![]() |
![]() |
#2 |
"Matthew Anderson"
Dec 2010
Oregon, USA
4A816 Posts |
![]()
One quadratic polynomial that merits consideration is
h(n) = n^2 + n + 41 It has the property that h(n) is prime for n=0..39. Note that h(40) = 40(40 + 1) + 41. Also, h(n) never has a factor smaller than 40 when n is an integer. I have a proof of this fact. I put some more results on the web at https://sites.google.com/site/mattc1anderson/home-1 I have some new results that I have not included on the internet. |
![]() |
![]() |
![]() |
#3 |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
3×7×479 Posts |
![]() |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
QS polynomials | Till | Factoring | 12 | 2021-08-04 21:01 |
prime generators for quadric irreducible polynomials | bhelmes | Computer Science & Computational Number Theory | 122 | 2017-08-25 21:09 |
Mersenne primes and irreducible polynomials | Nick | Puzzles | 0 | 2013-10-29 10:19 |
SNFS polynomials. | chris2be8 | FactorDB | 1 | 2012-03-10 16:49 |
SNFS polynomials for k*b^n+-1 | mdettweiler | Factoring | 15 | 2010-01-14 21:13 |