mersenneforum.org  

Go Back   mersenneforum.org > Fun Stuff > Puzzles

Reply
 
Thread Tools
Old 2012-10-06, 14:14   #1
henryzz
Just call me Henry
 
henryzz's Avatar
 
"David"
Sep 2007
Cambridge (GMT/BST)

131678 Posts
Default Primes on quadric irreducible polynomials

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?
henryzz is offline   Reply With Quote
Old 2013-02-17, 03:12   #2
MattcAnderson
 
MattcAnderson's Avatar
 
"Matthew Anderson"
Dec 2010
Oregon, USA

7×89 Posts
Default

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.
MattcAnderson is offline   Reply With Quote
Old 2013-02-17, 05:27   #3
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

100011110010002 Posts
Default

This recent prime is relevant to your interest
Batalov is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
QS polynomials Till Factoring 5 2018-02-12 16:30
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

All times are UTC. The time now is 20:22.

Sat Nov 28 20:22:00 UTC 2020 up 79 days, 17:32, 3 users, load averages: 1.32, 1.45, 1.62

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, 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.