![]() |
|
|
#936 |
|
Sep 2002
35F16 Posts |
UID: Jwb52z/Clay, M76106587 has a factor: 2253706211548544927116376383 (P-1, B1=690000, B2=12937500)
90.864 bits |
|
|
|
|
|
#937 |
|
Sep 2002
863 Posts |
P-1 found a factor in stage #2, B1=715000, B2=13227500.
UID: Jwb52z/Clay, M78208159 has a factor: 5980644118600514360767129 (P-1, B1=715000, B2=13227500) 82.307 bits |
|
|
|
|
|
#938 |
|
Sep 2002
863 Posts |
P-1 found a factor in stage #2, B1=690000, B2=12937500.
UID: Jwb52z/Clay, M76097309 has a factor: 160406892606660651307306068007 (P-1, B1=690000, B2=12937500) 97.018 bits. |
|
|
|
|
|
#939 |
|
Dec 2002
881 Posts |
I found a factor for the exponent 12973951 which has 2^11 as part of the value for 'k'. Any exponent with a 'k' that includes a higher power than 11?
|
|
|
|
|
|
#940 |
|
"Oliver"
Mar 2005
Germany
100010110112 Posts |
Hi tha,
you've asked for it, perhaps my highscore:and some slightly lower powers of 2:
and some even lower powers of 3:
and for 5: Oliver |
|
|
|
|
|
#941 |
|
Romulan Interpreter
"name field"
Jun 2011
Thailand
41·251 Posts |
If p is 1 (mod 4), then k can be 0 or 3 (mod 4), and if p is 3 (mod 4), then k can be 0 or 1 (mod 4). There is no k which is 2 (mod 4) because in this case 2kp+1 would be either 3 or 5 (mod 8) which is not possible for a factor.
Therefore, considering that 50% of the factors have a k which is 0 (mod 4), (i.e. 50% of the k's are multiple of 2^2 already) then about one in 1000 will have a k which is 0 (mod 2^11). As we have few millions of them... Last fiddled with by LaurV on 2015-05-19 at 06:43 |
|
|
|
|
|
#942 |
|
Feb 2012
1100101012 Posts |
M78098261 has a factor q=2715126139938490881846927116066757839; log2(q)=121.03...
k = 11*13*3911*7321*81547*1802039*28890311 = 17382756704009650623635058379; log2(k)=93.812... M78098261 has a factor q=56873105138451031651367; log2(q)=75.59... k = 19 * 23^2 * 29 * 163 * 7663739 = 364112493736903; log2(k)=48.371... |
|
|
|
|
|
#943 |
|
"Oliver"
Mar 2005
Germany
5·223 Posts |
indeed not a every day factor, congratulations!
Oliver P.S. I know there is nothing specials about these factors, small or big, B1-smooth or not, a factor is a factor. But bigger factors feel better than smaller ones (bigger is better!). |
|
|
|
|
|
#944 | |
|
Nov 2008
509 Posts |
Quote:
|
|
|
|
|
|
|
#945 |
|
Feb 2012
1100101012 Posts |
True.
Also, with slightly higher B1, the 76-bit factor could have shown up in the Stage 1 and the Stage 2 would not run at all. |
|
|
|
|
|
#946 |
|
Sep 2002
863 Posts |
P-1 found a factor in stage #2, B1=700000, B2=12950000.
UID: Jwb52z/Clay, M77149753 has a factor: 100126154465201540478799 (P-1, B1=700000, B2=12950000) 76.406 bits. |
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Sorry about last post I hope u like this new factor method | ONeil | ONeil | 4 | 2021-01-02 20:01 |
| Factor found that should have been found by P-1 | tha | Data | 65 | 2020-08-05 21:11 |
| 10 fold increase in new CPU's | Uncwilly | PrimeNet | 10 | 2019-11-13 18:18 |
| POST PRIMES you've found here, and name or prover code | TTn | 15k Search | 415 | 2006-03-02 21:17 |
| Post the numbers you have tried to factor here | hyh1048576 | Factoring | 11 | 2003-12-01 07:37 |