mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Aliquot Sequences

Reply
 
Thread Tools
Old 2009-11-17, 20:15   #221
rodac
 
rodac's Avatar
 
Sep 2009

73 Posts
Default

Quote:
Originally Posted by 10metreh View Post
That (2^3 * 3) is a driver, but it's the easiest to escape of all drivers, especially while the 3 is squared.
ok I thought that 2^3 * 3 was a guide...

---

Done with 723120
index 1247, 104 digits, 2^2 * 3 * 7
rodac is offline   Reply With Quote
Old 2009-11-17, 20:42   #222
10metreh
 
10metreh's Avatar
 
Nov 2008

2·33·43 Posts
Default

Done with
Code:
728640 3554. 2^4 * 3 * 5 * 31 c94 sz 101
This one went down from 92 to 11 digits (took several downdriver runs), but then it acquired 2^3 * 3 at 31 digits, that soon changed directly into 2 * 3, and that changed directly into 2^3 * 3 * 5, which changed directly into 2^4 * 31 at 95 digits. Life is sad sometimes.
10metreh is offline   Reply With Quote
Old 2009-11-17, 21:37   #223
Greebley
 
Greebley's Avatar
 
May 2009
Dedham Massachusetts USA

3·281 Posts
Default

Quote:
Originally Posted by 10metreh View Post
That (2^3 * 3) is a driver, but it's the easiest to escape of all drivers, especially while the 3 is squared.
I don't think it is a driver unless it has a factor of 5 and the exponent of 3 is one - so specifically 2^3*3^1*5

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.
Greebley is offline   Reply With Quote
Old 2009-11-17, 22:25   #224
Mini-Geek
Account Deleted
 
Mini-Geek's Avatar
 
"Tim Sorbera"
Aug 2006
San Antonio, TX USA

17×251 Posts
Default

Quote:
Originally Posted by Greebley View Post
I don't think it is a driver unless it has a factor of 5 and the exponent of 3 is one - so specifically 2^3*3^1*5
...
http://www.mersennewiki.org/index.php/Aliquot_Sequences
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).
Mini-Geek is offline   Reply With Quote
Old 2009-11-18, 02:22   #225
Buzzo
 
Buzzo's Avatar
 
May 2008

3·37 Posts
Default

done with 720912
reserving 723432
Buzzo is offline   Reply With Quote
Old 2009-11-18, 05:42   #226
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

224318 Posts
Default

Done with 725052 729792 727596 and 729660
Batalov is offline   Reply With Quote
Old 2009-11-18, 14:23   #227
Greebley
 
Greebley's Avatar
 
May 2009
Dedham Massachusetts USA

84310 Posts
Default

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
Greebley is offline   Reply With Quote
Old 2009-11-18, 15:45   #228
10metreh
 
10metreh's Avatar
 
Nov 2008

44228 Posts
Default

Quote:
Originally Posted by Greebley View Post
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.
Actually the definition of a driver is that, for 2^an, n\mid\sigma(2^a) and 2^{a-1}\mid\sigma(n).
10metreh is offline   Reply With Quote
Old 2009-11-18, 16:07   #229
Buzzo
 
Buzzo's Avatar
 
May 2008

11110 Posts
Default

done with 723432
reserving 723480
Buzzo is offline   Reply With Quote
Old 2009-11-18, 18:07   #230
Greebley
 
Greebley's Avatar
 
May 2009
Dedham Massachusetts USA

3×281 Posts
Default

Quote:
Originally Posted by 10metreh View Post
Actually the definition of a driver is that, for 2^an, n\mid\sigma(2^a) and 2^{a-1}\mid\sigma(n).
Actually that is the same thing, just stated more technically. The -1 in a-1 of the second expression is why class 1 is counted. In fact:
2^{a-<class>}\mid\sigma(n)
Greebley is offline   Reply With Quote
Old 2009-11-18, 18:41   #231
10metreh
 
10metreh's Avatar
 
Nov 2008

2·33·43 Posts
Default

Reserving 726354
10metreh is offline   Reply With Quote
Reply



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

All times are UTC. The time now is 21:52.


Fri Aug 6 21:52:43 UTC 2021 up 14 days, 16:21, 1 user, load averages: 2.74, 2.58, 2.53

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