![]() |
|
|
#221 |
|
Sep 2009
73 Posts |
|
|
|
|
|
|
#222 |
|
Nov 2008
2·33·43 Posts |
Done with
Code:
728640 3554. 2^4 * 3 * 5 * 31 c94 sz 101
|
|
|
|
|
|
#223 | |
|
May 2009
Dedham Massachusetts USA
3·281 Posts |
Quote:
Anything else isn't fully supported - the powers of two from the 'one more than the odd terms' must be greater or equal to the power of two. So for example 2^3*3 has only two twos from 3+1 which is less than the 3 of 2^3 so it is not a driver. Another way of stating it is that it cannot change the power of 2 unless one of the odd terms is a power higher than 1. So [driver]*p where p = 1 mod 4 doesn't escape. |
|
|
|
|
|
|
#224 | |
|
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
17×251 Posts |
Quote:
2^3 * 3 is a driver (an easy-to-break and slow-growing one), as well as 2^3 * 3 * 5 (a tough-to-break and fast-growing one). |
|
|
|
|
|
|
#225 |
|
May 2008
3·37 Posts |
done with 720912
reserving 723432 |
|
|
|
|
|
#226 |
|
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
224318 Posts |
Done with 725052 729792 727596 and 729660
|
|
|
|
|
|
#227 |
|
May 2009
Dedham Massachusetts USA
84310 Posts |
Ok, you are right. I looked at the Analysis and Class 1 (ones that can escape without a square term on the odd number if they get [driver]*p where p is 1 mod 4) is called a driver so that 2 can be included in the drivers. This has the side effect of including 2^3*3 as a driver as well.
I personally don't consider 2^3*3^2*5 to be a driver because this is class 2 and the exponent of 3 can't be lowered to 1 unless 5 is square. 2^5*3^2*7 can never go to 3^1 without changing the power of 2 so this one remains class 2. The analysis doesn't specifically mention these cases though so I am not sure if they are officially not drivers. ----------- Done with 721364, 114 digits, 2^3*3*5*7 Last fiddled with by Greebley on 2009-11-18 at 14:25 |
|
|
|
|
|
#228 | |
|
Nov 2008
44228 Posts |
Quote:
|
|
|
|
|
|
|
#229 |
|
May 2008
11110 Posts |
done with 723432
reserving 723480 |
|
|
|
|
|
#230 |
|
May 2009
Dedham Massachusetts USA
3×281 Posts |
|
|
|
|
|
|
#231 |
|
Nov 2008
2·33·43 Posts |
Reserving 726354
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Subproject #9: 150k-200k sequences to 110 digits | Mini-Geek | Aliquot Sequences | 151 | 2011-05-14 09:01 |
| Subproject #7: 100k-150k sequences to 110 digits | 10metreh | Aliquot Sequences | 185 | 2011-01-24 18:43 |
| Subproject #6: 50k-100k sequences to 110 digits | 10metreh | Aliquot Sequences | 203 | 2010-11-14 15:00 |
| Subproject #4: 10k-50k sequences to 110 digits | 10metreh | Aliquot Sequences | 345 | 2010-07-28 07:20 |
| Subproject #5: 800k-900k sequences to 100 digits | 10metreh | Aliquot Sequences | 431 | 2010-05-18 02:21 |