Reserving 730428, 730656

Members,

I really only dabble in math on occasion and have been looking over aliquot sequences with interest and happened across this forum.

I also dabble in programming.

To the point:

I ran across a couple of new prime factors for iteration 574 of number 730536 while playing with a C++ program I'm writing and playing with. Those factors are:

12541 and 71670491

I really have no easy way to verify my findings, so I don't know if they are valid. My program found them, and in all my latest testing, all my numbers have matched those in Syd's database. My program also gave me all the other factors that the database already shows ( 2^2 5 7 11 113 ). Do new factors get tested when entered? Should I enter them there? Is there a manner to enter the factors and the new unfactored portion or does Syd(?) produce the new portion? If I should enter the factors, should I enter one at a time or both at once?

Sorry for all the questions and apologies if I'm in the wrong forum or "dabbling" where I don't belong.

Take Care,
Ed

P.S. Why does the "Preview Post" button take me to the login screen?

Done with 733776, 101 digits, 2^4*5*31

[quote=Batalov;197849]Taking 730890, 734784, 734802, 734880, 734970
and 732168, 732360, 732540, 732928
[/quote]
Done with these 9.
Taking 730536, 730680, 731208, 731232, 731424, 731500, 731562

[QUOTE=EdH;197960]Members,

I really only dabble in math on occasion and have been looking over aliquot sequences with interest and happened across this forum.

I also dabble in programming.

To the point:

I ran across a couple of new prime factors for iteration 574 of number 730536 while playing with a C++ program I'm writing and playing with. Those factors are:

12541 and 71670491

I really have no easy way to verify my findings, so I don't know if they are valid. My program found them, and in all my latest testing, all my numbers have matched those in Syd's database. My program also gave me all the other factors that the database already shows ( 2^2 5 7 11 113 ). Do new factors get tested when entered? Should I enter them there? Is there a manner to enter the factors and the new unfactored portion or does Syd(?) produce the new portion? If I should enter the factors, should I enter one at a time or both at once?[/quote]

You will see that there is a box saying "Know a factor?" just above the sequence itself. You can enter new factors in here; to put both in at once, just separate them with a *. The database will automatically calculate the unfactored bit. "Syd" is the person who created and maintains the database.

You can also enter factors for a number in a sequence by clicking on that number and entering the factors in the "Report factor(s)" box.

If you want to enter lots of lines from a sequence, then click on "Report factors" (the fourth link at the very top) and enter the lines in there in .ELF format, which looks a bit like this:

[code] 909 . 110017887349050550211876496251418086965837894193558296453154649151308579006289930991115497462322240 = 2^6 * 3 * 5 * 19 * 127 * 47493562365766399974045317141273866800420419858387854180979179250979321645898056961905778363
910 . 260568680563540776817602227963884942813826591511059123178524169042572950278055099715799862418566080 = 2^6 * 3 * 5 * 127 * 191 * 56069921 * 199564803316423397486937509093195838153964313381177235143371098824728218409626350209
911 . 577616660763606296060760160218787407617840677438162270658113805851329328469612301345001418165359680 = 2^6 * 3 * 5 * 53 * 127 * 89389989842334951477733645356495352290682519536188634467716814900480570072180381404602061693
912 . 1305631621876981778643001267815296819483345531265883774053623281905457614163387805681720186742012864 = 2^6 * 3 * 47 * 127 * 248309 * 1073881 * 329699124169 * 5151991975673173 * 2515221643779839280562366149174375699768997856806266941
913 . 2250148724089793345343866075907819150903063532612923572953376100729472393443066295799799375741289536 = 2^6 * 3 * 127 * 2293 * 54888389 * 733198782686096952661057335328156517863121208870463444033366741626503890823923129277
914 . 3752864815208922411070741485466367536371841949028708506174839815176821635540534127854470656989825984 = 2^6 * 3 * 127 * 12245941 * 53112481 * 6156375849097 * 1722979885289611641554999 * 22308166968390776888500400039230646749709377[/code]

[quote]Sorry for all the questions and apologies if I'm in the wrong forum or "dabbling" where I don't belong.[/quote]

This thread is fine if it has anything to do with 700k-800k sequences, although it may have been better to start your own thread.

[quote]P.S. Why does the "Preview Post" button take me to the login screen?[/QUOTE]

Because the forum only keeps you logged on for 15(?) minutes at a time. To stay logged on indefinitely, tick the "Remember Me" box when logging on.

Taking 735096 736794 736820 736938 737550 738072 738288

[quote=EdH;197960]I ran across a couple of new prime factors for iteration 574 of number 730536 while playing with a C++ program I'm writing and playing with. Those factors are:

12541 and 71670491

I really have no easy way to verify my findings, so I don't know if they are valid.[/quote]
They are. [URL]http://factordb.com/search.php?se=1&aq=730536&action=range&fr=574&to=574[/URL] Syd's DB is already well past iteration 574 for aliquot sequence [URL="http://factordb.com/search.php?se=1&aq=730536"]730536[/URL]. [color=blue][b]10metreh:[/b] But it wasn't when EdH posted.[/color]
[quote=EdH;197960]Do new factors get tested when entered?[/quote]
Yes. The DB always checks that new factors do indeed divide the number, and will simply ignore any factors that don't work. It will also calculate the remaining portion and whether that is composite or prime.

Done with 730224, 100 digits, 2*3

done with 730428: size 100, 2^4*3*31
reserving 735294, 735960, 736002, 736680, 737490, 737640, 738528, 738678, 739398, 739788.
735966 is done for the subproject

unreserving 730260 at size 100, [COLOR="Red"]2²*7[/COLOR]

reserving 734052

Done with
730536, 730680, 731208, 731232, 731424, 731500, 731562,
735096, 736794, 736820, 736938, 737550, 738072, 738288,
and 650496 (because 736938 merged in it)

[URL="http://factordb.com/aliquot.php?type=1&aq=731208"][SIZE=1]731208[/SIZE][/URL][SIZE=1] extended from i362 to i3,831 (after reaching 100-digits already at i419)... too bad.[/SIZE]
[SIZE=1][/SIZE]
[SIZE=1]I'll keep 737550 reserved for the other thread.[/SIZE]

Reserving
739032, 739152, 739254, 739302, 739464, 739686, 739920

Done with 733800, 102 digits, 2^2*3*7
Keeping 733866 reserved at 114 digits (so done for project). It has the guide 2^11*3*5*7 which is 5 factors of 2 short (the full guide 2^11*3*5*7*39 is only 2 short so just misses being a driver).

unreserving 734052; i=638, sz. 101, [COLOR="Red"]2²*3*7[/COLOR]

[quote=Greebley;198194]Done with 733800, 102 digits, 2^2*3*7
Keeping 733866 reserved at 114 digits (so done for project). It has the guide 2^11*3*5*7 which is 5 factors of 2 short (the full guide 2^11*3*5*7*39 is only 2 short so just misses being a driver).[/quote]
Err. Ignore the full guide statement - it is wrong.

Taking 736944, 737034, 737160, 737240, 737664

Thank you for the responses to my query.

I have posted several factors to the db over the last couple of days and now see how it works.

In the "big picture" my musings are probably quite insignificant, but thanks for allowing me to provide them.

Perhaps I will try to do more if I can get a better understanding of the software everyone else is using and break away from my personal programming interests.

Should I still provide factors I run across to the db, or does it really matter when someone takes up working on that sequence again? At least for now, I will not be providing any factors larger than 20 digits; 10 digits in the very short term.

Take Care,
Ed

[quote=EdH;198336]Should I still provide factors I run across to the db, or does it really matter when someone takes up working on that sequence again? At least for now, I will not be providing any factors larger than 20 digits; 10 digits in the very short term.[/quote]
Factors that small are very easy (seconds at most) to find when you use efficient tools, so it wouldn't help too much for you to submit them to the DB. Don't bother. It's probably more trouble than it's worth.

[URL="http://factordb.com/search.php?se=1&aq=737490&action=last20&fr=&to="]737490[/URL] terminates
[URL="http://factordb.com/search.php?se=1&aq=738678&action=last20&fr=&to="]738678[/URL] : size 101, 2^2*7

sequence 728490 escaped 2^2*7 directly to the downdriver at i=507, sz. 109.

After two short downdriver runs (down to ~c75) it went back up to c108.

Releasing the sequence at i=1278, size 108, 2^3 (stable), so an interesting sequence is up for grabs.

BTW: I'd recommend QS for the c89 cofactor, as GNFS (using factMsieve.pl) failed:

[code]commencing linear algebra
read 247 cycles
cycles contain 798 unique relations
read 798 relations
using 20 quadratic characters above 26579724
building initial matrix
memory use: 0.2 MB
read 247 cycles
matrix is 5032 x 247 (0.0 MB) with weight 12263 (49.65/col)
sparse part has weight 7549 (30.56/col)
matrix is corrupt; skipping linear algebra
elapsed time 00:00:04
Some error occurred and matsolve did not record dependencies.
WARNING: gnfs failed to find a factor. This really shouldn't happen.
I'll just run ecm till the end of time or a factor turns up...
Let's hope you don't run out of disk space before either of those.
running 0 auto-increasing ecm curves...[/code]

Edit: reserving 734088

unreserving 729624 at i=1010, size 130 (oops...), [COLOR="Red"]2³*3*5[/COLOR]

Edit: reserving 734112

[quote=Andi47;198369]BTW: I'd recommend QS for the c89 cofactor, as GNFS (using factMsieve.pl) failed:

[code]matrix is corrupt; skipping linear algebra[/code][/quote]
I'm pretty sure a little more sieving would let you finish this one, if you've still got the files and are interested in finishing off that c89.

[QUOTE=Mini-Geek;198378]I'm pretty sure a little more sieving would let you finish this one, if you've still got the files and are interested in finishing off that c89.[/QUOTE]

I'm pretty sure too, but I currently don't have the personal time to do so...

unreserving 734088 at size 102, 2^5*3^3*5^2

reserving 734184

Done with 739032, 107 digits, 2*3*5*7

730656: i444->i904, size 110, 2^3*3^2*5*7
736002: i685->i3585, size 110, 2^4*3^4*31
unreserving both

Done with 736944 737034 737160 737240 737550 737664,
but will keep [I]737160 reserved[/I] for a bit longer.

Reserving 734520, 734592, 734676, 734760 - let's finish that 5K.

Reserving 735060

729960 is done for the subproject (C106) but i'm keeping it since it has no driver. (2^3 isnt a driver, right?)

[quote=Buzzo;198539]729960 is done for the subproject (C106) but i'm keeping it since it has no driver. (2^3 isnt a driver, right?)[/quote]
Nope, it's not a driver. You should be on a vaguely downward slope now (unless the guide changes). Good luck. :smile:

2^n isn't a driver (with no other terms) unless n = 1 in which case it is the down driver. In fact the complete list of drivers with n < 16 is:
2
2*3
2^2*7
2^3*3
2^3*3*5
2^4*31
2^5*3*7
2^6*127
2^9*3*11*31
2^12*8191

Edit: crosspost with Mini-Geek

thanks mini-geek and greebley, that is very helpful information!

735960: i241->i297, size 105, 2^3*3*5
736680: i2237->i2376, size 104, 2^2*5*7
737640: i2417->i2528, size 105, 2^4*3^2*31
738528: i2173->i2261, size 100, 2^4*31

Done with 734520, 734592, 734676, 734760

735060 is done.
Reserving 735342

Done with 739152, 120 digits, 2^5*3*7^2

735294: i2412->i2645, size 117, 2^4*3*7 - no driver
739398: i1133->i1298, size 111, 2*3^2*5

Done with 739254, 111 digits, 2^2*7

Reserving 736032, 736050, 736056

Done with 739302, 103 digits, 2^2*5*7

739788: i576->i965, size 102, 2*3

Sorry to be a pain. Hopefully, I can be helpful at some point.

I have aliqueit running on one of my machines finally. I have been testing it against 736896 and it has advanced a few index lines. Should what I have be verified somewhere before adding it to Syd's db?

Should I reserve this number and work with it toward the project?

(Should I leave you guys alone and go play somewhere else?):smile:

Take Care,
Ed

[quote=EdH;198825]I have aliqueit running on one of my machines finally. I have been testing it against 736896 and it has advanced a few index lines. Should what I have be verified somewhere before adding it to Syd's db?[/quote]
No, that's not necessary. Syd's DB verifies all factors when you submit them. Besides, if you use normal tools like aliqueit (and its tools), there is very little chance that it will produce inaccurate factors (whenever you start aliqueit, it verifies all factors in the .elf file before running the sequence). Go ahead and submit them.
In case you're not quite sure of a good way to do this, you can run "aliqueit 736896 -s 0" to submit the whole file you've got, or change the 0 to the first index the DB doesn't have finished yet to just send the relevant portion of the file, (right now index 669) or you can copy/paste the lines from the .elf file to [URL]http://factordb.com/search.php?report=true[/URL]
[quote=EdH;198825]Should I reserve this number and work with it toward the project?[/quote]
Well, that's completely up to you. :smile: I see no problem at all with you reserving it.
I would prefer that you be willing to take it all the way to 100 digits, (and preferably stop at a decently large number, at least 70 digits, that passed all ECM) and are planning on doing so at a decent speed. (there is no set time limit or anything like that, I'd just rather not have it be running on a Pentium II that's only on 5 hours a day, if you know what I mean. :smile:)

[quote=Mini-Geek;198827]No, that's not necessary. Syd's DB verifies all factors when you submit them. Besides, if you use normal tools like aliqueit (and its tools), there is very little chance that it will produce inaccurate factors (whenever you start aliqueit, it verifies all factors in the .elf file before running the sequence). Go ahead and submit them.
In case you're not quite sure of a good way to do this, you can run "aliqueit 736896 -s 0" to submit the whole file you've got, or change the 0 to the first index the DB doesn't have finished yet to just send the relevant portion of the file, (right now index 669) or you can copy/paste the lines from the .elf file to [URL]http://factordb.com/search.php?report=true[/URL][/quote]

Worked well! I C/P'd several lines (669-712) and all showed up.

[quote=Mini-Geek;198827]Well, that's completely up to you. :smile: I see no problem at all with you reserving it.
I would prefer that you be willing to take it all the way to 100 digits, (and preferably stop at a decently large number, at least 70 digits, that passed all ECM) and are planning on doing so at a decent speed. (there is no set time limit or anything like that, I'd just rather not have it be running on a Pentium II that's only on 5 hours a day, if you know what I mean. :smile:)[/quote]

Let me see how this runs until someone else grabs the number and I'll jump out. I'm running an idle laptop that has a Pentium 4 2.4 GHz CPU, but only 512Meg. It did about 40 lines in the last two hours, but they are only about 80 digits. I can run it for around 14 hours/day.

Any problems with this approach, let me know.

Thanks.

[quote=EdH;198834]Let me see how this runs until someone else grabs the number and I'll jump out. ...[/quote]
I've marked it as reserved by you. If you don't want to bring it all the way to 100 digits that's ok, just let me know and I'll put it back in the list of available numbers.

[QUOTE=EdH;198834]I'm running an idle laptop that has a Pentium 4 2.4 GHz CPU, but only 512Meg.[/QUOTE]

RAM is not an issue unless you're doing GNFSs on really big numbers.

[quote=Mini-Geek;198835]I've marked it as reserved by you. If you don't want to bring it all the way to 100 digits that's ok, just let me know and I'll put it back in the list of available numbers.[/quote]

Thank you. I'll take it to 100. Let me know if I'm not there fast enough.:smile:

[QUOTE=EdH;198840]Thank you. I'll take it to 100. Let me know if I'm not there fast enough.:smile:[/QUOTE]

Don't worry, we're not in a hurry. There isn't another project we're in a race with, and we hope it stays that way. :smile:

reserving 735360

[quote=Mini-Geek;198827]I would prefer that you be willing to take it all the way to 100 digits, (and preferably stop at a decently large number, at least 70 digits, that passed all ECM) and are planning on doing so at a decent speed. (there is no set time limit or anything like that, I'd just rather not have it be running on a Pentium II that's only on 5 hours a day, if you know what I mean. :smile:)[/quote]

OK, I have it (736896) at index 806 size 102, but am still letting it run because I'm not sure about the "(and preferably stop at a decently large number, at least 70 digits, that passed all ECM)" statement above. Sorry for my ignorance. How do I tell something has passed all ECM?

Take Care,
Ed

[quote=EdH;198957]OK, I have it (736896) at index 806 size 102, but am still letting it run because I'm not sure about the "(and preferably stop at a decently large number, at least 70 digits, that passed all ECM)" statement above. Sorry for my ignorance. How do I tell something has passed all ECM?

Take Care,
Ed[/quote]
If aliqueit finishes ECM on a number without finding a factor, it will either begin SIQS (using YAFU or Msieve) or GNFS (using GGNFS), depending on the size (around 90-100 digits is a good cutoff to switch to GNFS). So when what you're seeing changes from aliqueit showing a line saying it's running ECM (or P-1 or P+1) to the output of one of the other programs, it's passed all ECM. It'll say how large the number is, and from that you can know if it's a relatively large number or not (e.g. 70 digits, like I said before).
I can't say I'm 100% sure why you should stop on a tough composite instead of just anywhere, but since that's the way everyone does it, if you don't you might make somebody at some point waste some time by running SIQS/GNFS on a number that has an easily found factor.

I think I have the idea then. My last few lines are:

[code]
806 . c102 = 386429243769394716051180254077642345811022487402582255907568795631341589321719440410093574149817222700 = 2^2 * 3 * 5^2 * 7 * 211 * 1110181 * 9499959158813781394644541574553211 * 82689945633923936673872152672136741069521470194141389387
c87: running 233 ecm curves at B1=25e4...
sieving in progress (press Ctrl-C to pause)
9468 relations (6318 full + 3150 combined from 236995 partial), need 56763
[/code](The "9468" above is counting up.)

I should be safe to consider index 806 is correct and it is now working on an 87 digit portion of the index 807 calculations.

So, if I stop here, I have met the normal requirements and I can add the last index (806) from the elf file to the db? Should I retrieve the minor factors from the log file and add those manually to the 807 line that will appear in the db?

Sorry if I'm taking too long to come up to speed. Thanks for the help.

Take Care,
Ed

Yep, that is all correct. :smile:
[quote=EdH;198975]Should I retrieve the minor factors from the log file and add those manually to the 807 line that will appear in the db?[/quote]
It'd be easiest to just use the Quick ECM option once or twice until the remaining cofactor is the same size as the one you got (in this case c87). In nearly all (all you're likely to run into on this subproject) cases where you leave a sequence at a tough number like this, Quick ECM will easily find the necessary factors.

I've removed your reservation from the list of active reservations since it's complete.
Edit: I don't know if it was you or someone else, but I see the DB now has it up to index 807 and the c87, so there's nothing else you need to do. You could learn about reporting your ECM curves, but it's not too important. We'll leave that for another day and a situation where it's more important. :smile:

[quote=Mini-Geek;198976]I've removed your reservation from the list of active reservations since it's complete.
Edit: I don't know if it was you or someone else, but I see the DB now has it up to index 807 and the c87, so there's nothing else you need to do. You could learn about reporting your ECM curves, but it's not too important. We'll leave that for another day and a situation where it's more important. :smile:[/quote]

Thanks! It was me that added 806 and did the Quick ECM on 807.

I was about to unreserve 736896 with this message:smile:.

I'd like to reserve 738048 and play some more, then.

Thanks for your help. I think I have the hang of it. Holler at me if I need it, (edit) or when you think I'm ready for "the next step." I am trying to keep files relevant to 736896 in a directory for it. Hopefully, I grabbed all the pertinent ones.

Take Care,
Ed

Done with 739464, 113 digits, 2^3*3^2*5. With the square term on the 3 this isn't really a driver.

734112 Andi47 <-- sz 117, 2^2*7^2
734184 Andi47 <-- sz 103, 2^2*7

unreserving both.

reserving 735882

reserving 738546, 738612, 736890

update is online

unreserving 735882 at i=1356, sz 105, [COLOR="Red"]2²*7[/COLOR]

I'm reserving all 744xxx

Reserving 736194

736890: i467->i501, size 101, 2^3*3^2
738546: i591->i652: size 103, 2^4*5*31
738612: i404->i462: size 105, 2^3*3*5

I'm just recalling that 730224 is done for the subproject... :smile:

Will take 742000 742140 742710 742788

744330: i664->i1666, size 101, 2^3*3*5
744432: i623->i704, size 105, 2^3*3*5
744660: i739->i2268, size 100, 2*3^2
744804: i1623->i2119, size 100, 2^5*3*7^2

reserving 742350

Finished 738048: i989 size 101, 2[sup]2[/sup]*7*17

reserving 736950

Done with 742000 742140 742710 742788

742350: i1112->i1251, size 108, 2^3*3*5^2
744864: i2037->i2172, size 102, 2^2*3^2*7^2
744888: i737->i847, size 100, 2*3^3*5

Done with 739686, 113 digits, 2*3

744480: i685->i787, size 102, 2^4*3^2*5*31
744822: i1059->i1062, size 100, 2^5*3^2*7

744156: i836->i1078, size 100, 2^2*7
744816: i452->i946, size 100, 2*3^2

done with 735360
reserving 738144

Done with 739920, 104 digits, 2^2*5*7

Reserving:
743088, 743106, 743280, 743310, 743370, 743646

744168: i685->i1270, size 103, 2^4*3^2*7*31

736950 went up to 102 digits for three iterations, but is now back at 101 for a couple. Should I consider it finished or let it run for awhile to see where it goes?

[code]
965. 149583538779927645172351076947076528433253382292675188248824876177648917014015929551909705724462487952 = 2^4 * 8923897 * 1047633245178141099485117579146451715778245355509168165606523109926420857768304093715375312801
966. 140234600082812767871453218676529198946178235024989009767486455218762267419686524772342254293594920124 = 2^2 * 157 * 6733 * 306431 * 108231636123699506632658440266373008216560062182306145434124364223715327977985564193624921
967. 106776561747846948049237432017470362125574133651329516110032201320456719011590556300659512843642004292 = 2^2 * 1777350427 * 22489281642403899126767 * 667832107293288299651963166508520022202719579821509493538614591604397
968. 80082421416018661492248400519847984451414579975574029299123197861742682377189990924905453228474485052 = 2^2 * 257 * 595709 * 2443213 * 52164539322401617947304790446577167 * 1026061076868350872145112128374475612599496837176681
969. 60607418134566017627927218425409734123402553852308988447773625154617018642395840768965235174171611588 = 2^2 * 19 * 37 * 127
[/code]Take Care,
Ed

[quote=EdH;199439]736950 went up to 102 digits for three iterations, but is now back at 101 for a couple. Should I consider it finished or let it run for awhile to see where it goes?[/quote]
It's up to you, but if I were you I'd let it keep going. The guide you've got now is 2^2, which tends to make the sequence go down slowly.

I keep many of the hopeful ones in an attempt to find the terminating ones. 2^2 is also one of the best guides (it has been called the down guide). As mentioned though, it is your choice whether you want to explore further or let someone else do it.

I have started a collection of sequences without drivers that I run with the -q option to do only one iteration so I can switch between them - but only because I have a second computer to run them while still running at least one of these.

Thanks,

Maybe I'll keep it awhile. I am running two machines (one each) against the two numbers I have reserved, but the other one is getting really slow. Actually both of these have been hitting some numbers that are taking a few hours to sieve. They seem to take off for a few lines when they finally make it through. I have a third (linux) machine I was trying to run gmp-ecm on, to see if I could find a factor that way, but I'm not sure I know what I'm doing there, yet.:smile:

Oh, well, a little more playing, I guess. This one (736950) did have a down run in the late 700's-early 800's and made it down to 79 digits for a while, before turning upward again.

Take Care,
Ed

[quote=EdH;199453]This one (736950) did have a down run in the late 700's-early 800's and made it down to 79 digits for a line, before turning upward again.[/quote]

That should have read "79 digits for a while." I guess you can't edit after you've logged out and back in...:no:

Take Care,
Ed

[QUOTE=EdH;199477]That should have read "79 digits for a while." I guess you can't edit after you've logged out and back in...:no:[/QUOTE]

The limit on post editing is 60 minutes (unless you're a mod of course). But as I'm a mod, I'll correct the error.

[quote=10metreh;199493]The limit on post editing is 60 minutes (unless you're a mod of course). But as I'm a mod, I'll correct the error.[/quote]

Thanks, I'll try to be more error-free..:smile:

I've run 736194 up to 100 digits, 2 * 3^2 * 5 * 701 * 823

So I now release it.

I've moved 736950 over to a machine I have running continuously now. Let's see where it goes.

I'd also like to reserve 738936.

Take Care,
Ed

Done 736032, 736050, 736056

Reserving 736036 (due to typo - number seems not to be reserved before)

Reserving 740096, 740106, 740640, 740670

Done with 743088, 113 digits, 2^2*3*5^2*7

735342 is done.

[quote=EdH;199536]I've moved 736950 over to a machine I have running continuously now. Let's see where it goes.[/quote]

I have it below 100 again. Does that mean I need to re-reserve it.:smile:

On an opposite note, I hope to finish 738936 by tomorrow. Is it of any interest that it has carried 2[sup]6[/sup] continuously from i1514 through the current i1941?

Take Care,
Ed

[quote=EdH;199658]I have it below 100 again. Does that mean I need to re-reserve it.:smile:[/quote]
Your reservation for that number was moved to [URL="http://www.mersenneforum.org/showthread.php?t=11588"]the main reservations thread[/URL] some time ago.
[quote=EdH;199658]On an opposite note, I hope to finish 738936 by tomorrow. Is it of any interest that it has carried 2[sup]6[/sup] continuously from i1514 through the current i1941?[/quote]
If it was just 2^6, yes it would be, but unfortunately you've got 2^6 * 127, a perfect number driver. For more info on drivers, etc. see [URL]http://www.mersennewiki.org/index.php/Aliquot_Sequences[/URL] Perfect number drivers, especially the larger ones like 2^6 * 127, are very difficult to get rid of.

[quote=Mini-Geek;199666]Your reservation for that number was moved to [URL="http://www.mersenneforum.org/showthread.php?t=11588"]the main reservations thread[/URL] some time ago.[/quote]

That's where it went! Thank you.


[quote=Mini-Geek;199666]If it was just 2^6, yes it would be, but unfortunately you've got 2^6 * 127, a perfect number driver. For more info on drivers, etc. see [URL]http://www.mersennewiki.org/index.php/Aliquot_Sequences[/URL] Perfect number drivers, especially the larger ones like 2^6 * 127, are very difficult to get rid of.[/quote]

I was trying to find that info. Thanks for the link. I have it at 102 digits now, so I'll release it.

738936 is at i1949, c102, 2[sup]6[/sup] * 3[sup]2[/sup] * 73 * 127 * 457 * 617

[FONT=monospace]Take Care,
Ed

[/FONT]

[url]http://www.lafn.org/~ax810/analysis.htm[/url] is also useful for finding out about drivers and guides.

Reserving 738912.

738912 has reached 100 digits and lost its driver (now has the downguide). Moving to main reservations...

Done 736036

I just noticed 736036 merged with 315980 and 397600. :blush:

So 315980 is at size107, c100 now

Done with 743106, 107 digits, 2^2*3*7

done with 738144
reserving 738240

Done with 743280. It terminated.

done with 738240
reserving 738402