20120226, 16:29  #1 
Dec 2009
3^{3} Posts 
Highly composite polynomials.
"Other polynomials of this type include n^6 + 29450922301244534, which was discovered by Carmody in 2006 (Rivera) and is prime for 63693"
http://mathworld.wolfram.com/PrimeG...olynomial.html Why did they not publish a better solution? Why not 100000, 200000, ...? Last fiddled with by ewmayer on 20130217 at 20:02 Reason: grammar fixed at author request 
20120226, 16:50  #2 
Dec 2009
33_{8} Posts 
625567359447343581348856464285098545399036422015846188212576\
005216959264198326888770861800982403133642359585169933857500\ 94682865830363609 291648 
20120227, 04:16  #3  
Jun 2003
14EF_{16} Posts 
Quote:
What is this supposed to represent? 

20120227, 05:01  #4 
Romulan Interpreter
"name field"
Jun 2011
Thailand
26EA_{16} Posts 
I assume (from the page on mathworld linked by the OP) that the first number is a prime generated by the polynomial when x is substituted with the second (red) value. What is used for, no idea...
Last fiddled with by LaurV on 20120227 at 05:04 
20120227, 05:22  #5  
Jun 2003
23×233 Posts 
Quote:
EDIT: Figured it out. The generating polynomial is n^6+ 625567...63609 and its first prime is found at n=291648. Which is superficially better than the first polynomial, but, once you factor in the average size of the numbers generated, is relatively worse. Last fiddled with by axn on 20120227 at 05:28 

20120227, 14:11  #6 
Dec 2009
3^{3} Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
QS polynomials  Till  Factoring  12  20210804 21:01 
Mersenne primes have highly composite p1?  ATH  Math  3  20090615 13:11 
efficient generation of highly nonprimitive roots  vector  Math  7  20071114 16:07 
Factoring with Highly Composite Modulus  mgb  Math  3  20060909 10:35 
Factoring highly composite Mersenne numbers  philmoore  Factoring  21  20041118 20:00 