![]() |
Done with 724896, 115 digits, 2^5*3*7 - did someone run the wrong sequence? My run was only 112 digits, so someone else must have done this.
|
Taking 721386 721518 721764.
|
Done with 724410, 108 digits, 2^4*3*5*7*31
|
Also done with 724248, 101 digits, 2^2*5^3*7^2
|
done with 718920
reserving 720018 |
Done with 724650, 113 digits, 2^3*3*5
Reserving: 721032, 721080, 721364, 721392, 721470, 721536, 721728, 721980, 721992 |
done with 720018
reserving 720312 |
Done with [code]721280 404. 2^2 * 3 * 5 * 7 c97 sz 103[/code]
|
done with 720312
reserving 720552 |
Reserving 729840, but will be away for most of the weekend, so not much work.
|
Will take 725052 729792 727596 and 729660
|
Taking 726174 727056 727122 727830 728610
|
Releasing 727122; a "mysterious worker" has pushed up the sequence to 104 digits !
|
[quote=Batalov;195836]Will take 725052 729792 727596 and 729660[/quote]
[URL="http://factordb.com/aliquot.php?type=1&aq=729660"]729660[/URL] reached down to 9 digits. Twice... Escaped 2^3*3*5 into downdriver. But not for long and then, ballooned into stratosphere with a new 2^3*3*5. No merge. Life is still interesting. |
[QUOTE=rodac;195845]Releasing 727122; a "mysterious worker" has pushed up the sequence to 104 digits ![/QUOTE]
sorry, was me! done it a few days ago. i was not aware, that this range was already offered here. just completed 730272, too. |
[QUOTE=10metreh;195835]Reserving 729840, but will be away for most of the weekend, so not much work.[/QUOTE]
Er... maybe not. With a C2D to hand, I can say that I am done with [code]729840 1572. 2^2 * 7 c95 sz 101[/code] This one had a few short downdriver runs, but the last (which only lasted two lines) dropped directly into 2^2 * 7. |
Reserving 728640
|
Done: 722142, 722430, 722800, 722904
Reserving 727008, 727110, 727536, 727770 |
done with 720552, this one accidentally ran a little too long and got to c111 :smile:
reserving 720762 |
Done with 721032, 119 digits, 2^2*3*7^2
|
720996 is done for the subproject (108 digits at i: 1006), but I keep it, up to push it further (driverless !)
|
Done with 721080, 103 digits, 2^3*3*5*7
|
Done with 726174, index 601, 103 digits, 2^3 * 3 * 5
|
done with 720762
reserving 720912 |
727830 is done for the subproject
I keep it reserved because it has no driver index 2159 - 104 digits - 2^3 * 3^2 |
[QUOTE=rodac;196182]727830 is done for the subproject
I keep it reserved because it has no driver index 2159 - 104 digits - 2^3 * 3^2[/QUOTE] That (2^3 * 3) is a driver, but it's the easiest to escape of all drivers, especially while the 3 is squared. |
[quote=10metreh;196183]That (2^3 * 3) is a driver, but it's the easiest to escape of all drivers, especially while the 3 is squared.[/quote]
ok I thought that 2^3 * 3 was a guide... :smile: --- Done with 723120 index 1247, 104 digits, 2^2 * 3 * 7 |
Done with [code]728640 [B]3554.[/B] 2^4 * 3 * 5 * 31 c94 sz 101[/code]
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. :sad: |
[quote=10metreh;196183]That (2^3 * 3) is a driver, but it's the easiest to escape of all drivers, especially while the 3 is squared.[/quote]
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. |
[quote=Greebley;196219]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
...[/quote] [url]http://www.mersennewiki.org/index.php/Aliquot_Sequences[/url] 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). |
done with 720912
reserving 723432 |
Done with 725052 729792 727596 and 729660
|
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 |
[QUOTE=Greebley;196275]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.[/QUOTE]
Actually the definition of a driver is that, for [tex]2^an[/tex], [tex]n\mid\sigma(2^a)[/tex] and [tex]2^{a-1}\mid\sigma(n)[/tex]. |
done with 723432
reserving 723480 |
[quote=10metreh;196282]Actually the definition of a driver is that, for [tex]2^an[/tex], [tex]n\mid\sigma(2^a)[/tex] and [tex]2^{a-1}\mid\sigma(n)[/tex].[/quote]
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: [tex]2^{a-<class>}\mid\sigma(n)[/tex] |
Reserving 726354
|
done with 723480
reserving 723528 |
reserving 723780
|
Done with 721392, 101 digits, 2*3^4
|
Done with 724014 which was already past 100 digits. It picked up 2^3*3*5 and is 116 digits.
|
done with 723528
reserving 723834 |
724578 has had a bunch of ups and downs; I have run it for a full week now. It has been stuck between 100 and 110 digits for about 200 indices. It is still driverless so it is done for this project, but I will keep to see where it goes next.
|
releasing 723780 at i=713, sz. 107, [COLOR="Red"]2²*3*7[/COLOR]
|
Done with 712470, 105 digits, 2^3*3^3*5
Edit by mod: By 712470, he of course meant 721470. :smile: |
Done with 721536, 103 digits, 2^2*3*7
|
Done with 721728, 102 digits, 2*3^2
Note that I typed 712470 meaning 721470 above. |
Keeping 721980 reserved 105 digits, 2^3
Done with 721992 at 107 digits, 2^2*3*7 Won't reserve new numbers yet as I will be traveling to the end of the month. |
721386 is done for the subproject, but I keep it (driverless !)
index 1254 - 102 digits - 2^3 |
Done 722250, 722688, 727110
Reserving 729000 |
721764 is done for the subproject, but I keep it (driverless !)
index 1264 - 101 digits - 2^6 * 7 |
done with 723834
reserving 725160 |
721518 is done for the subproject, but I keep it to run it further
index 1099, 101 digits, 2^3 * 3 * 7 |
done with 725160
reserving 725490 |
done with 725490
reserving 725592 |
727056 has reached 100 digits, without any driver (2^4 * 3), at index 1767. A few iterations later, the 3 is gone and the sequence is continuing just below 100 digits.
I keep it to run it further. |
Done 727536, 727770
Reserving 727812, 727836, 728280 |
Done with 728610, index 1312, 103 digits, 2^4 * 31
|
reserving 729480
|
done with 725592
reserving 725724 |
done with 725724 - it has 2^4 * 3 * 11^2 * 13 * c97; is this a driver or a guide? [color=blue][b]10metreh:[/b] It's not a driver - technically 2^4 is the guide, but the other factors tend to persist. [/color]
reserving 725940 |
updates are online.
|
reserving [strike]725592[/strike] <--mystery worker was here
[strike]726030[/strike] <-- and here too [strike]728552[/strike] <-- yet another mystery worked sequence reserving 728490, 728580 |
[QUOTE=Andi47;197173]reserving [strike]725592[/strike] <--mystery worker was here
[strike]726030[/strike] <-- and here too 728490[/QUOTE] 725592 was me, somebody forgot to remove it from the available sequences. i don't know about 726030 |
Could this be the mystery worker who helped us on Subproject #2? If so, then they must know about us because 600-700k hasn't been done. Could you please reveal yourself? There is no particular reason why you shouldn't.
I might ask Syd to find out the IP, and then ask Xyzzy to find out whether they use this forum, and if so, who they are. And reserving 731328. |
reserving 733410, 734850
|
I'll try 730632
|
Done with 730632 ...and 732216
|
Done with 733410 and 734850.
|
...and 729480 also done
reserving 731280, 730020, 730320 |
reserving 728676
|
Taking 730224 731178 733290.
|
done with 725940
reserving 728760 |
done with 730020: size 100, 2^3*3^2*5^2
|
Done with [code]731328 918. 2^6 * 3^3 * 127 c87 sz 101[/code]
|
done with 730320: size 101, 2^3*3*5
|
Done with [code]726354 1118. 2^3 * 3 * 13 c95 sz 100[/code]
This sequence was littered with largish composites, which is why it took so long. Reserving 732036 |
728490 got stuck at i=386, size 94, cofactor c91 (matrix corrupt, seems that I have got just enough rels to pass the filtering step, but not enough for a matrix), doing (manually started) QS now.
Feature request for aliqueit: an option to force QS (or GNFS *sieving* before proceeding to linalg if possible) for just the next iteration. Edit: 728580 is at size 110 with 2^2*7, unreserving this one. (Edit2: the cofactor is fully ECMed.) |
[QUOTE=Andi47;197358]728490 got stuck at i=386, size 94, cofactor c91 (matrix corrupt, seems that I have got just enough rels to pass the filtering step, but not enough for a matrix), doing (manually started) QS now.
Feature request for aliqueit: an option to force QS (or GNFS *sieving* before proceeding to linalg if possible) for just the next iteration.[/QUOTE] i've got this error a bunch. i read up on it and what i do is use minrels.txt so it needs a little more relations than it has already. that makes it do more sieving. |
done with 728760
reserving 728988 |
unreserving 728676; i=1505, size 100, 2*3²
|
reserving 729624
|
I am releasing 724578 which was already done for this sub-project. It picked up the 2^2*7 driver.
Reserving 733068, 733152, 733452, 733752, 733776, 733800, 733866 |
done with 733068, 103 digits, 2^2*7
|
Done with 733152, 102 digits, 2^3*3^2*5
This wins the fastest completion by going from 85 to 100 digits in 20 minutes or so (I ran a little longer). |
done with 731280: size 108, 2^2*3^3*7
|
I almost forgot to mention that I am done with [code]732036 552. 2^4 * 3 * 31 c85 sz 100[/code]
|
Done and submitted: 727008, 727812, 727836, 728280, 729000
|
done with 728988 - 1400 lines added! :w00t:
reserving 729894 |
Done with 731178, 102 digits, 2^2 * 3 * 7
|
733290 is done for the subproject, but I keep it to run it further (driverless !)
index 984, 101 digits, 2^4 * 3 |
done with 729894
reserving 729960 |
Taking 730890, 734784, 734802, 734880, 734970
|
and 732168, 732360, 732540, 732928
|
reserving 730260
|
Done with 733452, 117 digits, 2^3*3. Took a while to gain a driver.
|
Done with 733752, 106 digits, 2^3*3*5
|
| All times are UTC. The time now is 07:30. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.