20120410, 22:00  #100 
Feb 2012
Paris, France
7×23 Posts 
(2^13191*1131)/903 is prime, N1 proof, done.
(2^13257*711)/36351 is prime, N1 proof, done. (2^13261*31)/5 is prime, N1 proof, done. (2^13285*331)/65 is prime, N1 proof, done. (2^13331*271)/215 is prime, N1 proof, done. (2^13503*1591)/1271 is prime, N1 proof, done. (easy thanks to henryzz's prp_provable.txt above) 
20120413, 08:00  #101 
Feb 2012
Paris, France
7·23 Posts 
(2^10125*251)/799, N1 proof, done.
(2^10326*471)/3007, N1 proof, done. (2^10334*371)/147, N1 proof, done. (2^10421*531)/1695, N1 proof, done. (2^10663*231)/2943, N1 proof, done. (2^10712*971)/387, N1 proof, done. (2^10874*71)/27, N1 proof, done. 2^11647127, N1 proof, done. (2^14258*171)/67, N1 proof, done. (2^14942*231)/91, N1 proof, done. (2^15916*671)/1071, N1 proof, done. (2^18879*51)/39, N1 proof, done. (thanks to henryzz's prp_provable.txt). Uploading the certificate for ((10^3741*245+43)/9+1)/36 allowed an N+1 proof of (10^3741*245+43)/9. 
20120417, 13:53  #102 
"William"
May 2003
New Haven
2^{2}·593 Posts 
Browsing the smallest PRPs, I found 2^1502*125, easily helped to a N1 proof.

20120502, 18:50  #103 
"William"
May 2003
New Haven
100101000100_{2} Posts 
Here's something new, at least in this thread!
This number is (p^31)/(13*(p1)). N1 has factors of (p3) and (p+4). This works when the other factors of the cyclotomic (the 13 in this case) can be expressed as k*(k+1)+1. The factors of N1 are (pk) and (p+k+1). In loading some OddPerfect factorizations, I've also seen cases with k=1, 2, 4, 9, 28, 60, 68 and 353 although most of those did not produce enough primes to finish the N1 proof. This one worked with k=3, too. This one worked with k=2 
20120503, 14:01  #104 
"Daniel Jackson"
May 2011
14285714285714285714
3^{2}·79 Posts 
Can you please tell me the value of p?

20120506, 21:27  #106 
Sep 2010
Scandinavia
3×5×41 Posts 
Here are a bunch of 3PRPs of the form (p^q1)/(p1).
Some have proof in the db, some have been proven by Andy Steward et al. and many have never been proven. 
20120506, 22:38  #107 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
26AF_{16} Posts 
For the lowhanging fruit, the KonyaginPomerance can be easily run on more of them  those that have 3033.33% factored N+1. It is a simple script (unlike CHG); easily automated.

20120519, 08:56  #108 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
3·3,301 Posts 

20120612, 07:20  #109 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
3·3,301 Posts 
10^9999+658628^31 10^9999+1301728^31 10^9999+2877590^31 10^9999+1570022^31 PRP cofactors: Code:
(10^3333+1301728)/2^5/5311159/44622313/375265619 has 3309 digits (10^3333+2877590)/4290 has 3330 digits (10^3333+658628)/2/2/3501/32612383/1523444177 has 3313 digits (10^3333+1570022)/2/133461/134268923417549 has 3314 digits There's one more, I'll do it myself: 10^9999+2779222^31 
20130306, 22:48  #110 
"William"
May 2003
New Haven
2^{2}×593 Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Can two Mersenne numbers share a factor?  James Heinrich  Math  57  20110912 14:16 
Avoidance of self & otherdeception in proofs  cheesehead  Soap Box  71  20100114 09:04 
Curious and want to share about Prime number 23  spkarra  PrimeNet  4  20091120 03:54 
Status of GIMPS proofs  BrianE  Information & Answers  7  20070802 23:15 
Collection of Proofs?  Orgasmic Troll  Math  1  20041230 15:10 