[QUOTE=akruppa;298693]Well, well, well. What have we here?[/QUOTE]

Arggggg

Btw, I'm doing NFS on the C101.

[QUOTE=akruppa;298693]Well, well, well. What have we here?[/QUOTE]

Wow. It only lasted 3 lines.

found a nice p50 for line 3241
[code]Using B1=4000000, B2=11415205630, polynomial Dickson(12), sigma=4391922847262760571
Step 1 took 10625ms
Step 2 took 7114ms
********** Factor found in step 2: 45416124634863473662413395025713212988554679679571
Found probable prime factor of 50 digits: 45416124634863473662413395025713212988554679679571
Probable prime cofactor 25508576380978103091317282772459882271991864252304997022734869257428350983 has 74 digits
[/code]

[QUOTE=Dubslow;298703]Wow. It only lasted 3 lines.[/QUOTE]
What only lasted 3 lines? The suspense is killing me! :-)

[QUOTE=Batalov;298752]What only lasted 3 lines? The suspense is killing me! :-)[/QUOTE]

[CODE]9661· c132 = [B]2[SUP]2[/SUP] · 3[/B] · 11 · 31 · 353 · 613 · 14387 · 643178369650376017 · 991644996925961632533902637367445413049636900849 · 55323601517800262358753763492036420403942500981785229
9662· c132 = [B]2[SUP]2[/SUP] · 3[/B] · 11 · 1229 · 13877 · 27376303 · 11957822966056413250553273496383084681889255122857774658405664459834559776367233827892118406177333463665964452139181
9663· c133 = [B]2[SUP]2[/SUP] · 3[/B] · 27553321 · 431044261 · 3637509037 · 157768746359767876402363891 · 13945548933403944721096352866731110525584844156577476991306762091091154176068813[/CODE]

[QUOTE=Raman;298756]ERROR: Stack overflow -- too many frickin' [noparse][CODE][/noparse] tags.[/QUOTE]Was that on purpose?[QUOTE=Batalov;298752]What only lasted 3 lines? The suspense is killing me! :-)[/QUOTE]The '3' in 2^2 * 3 only lasted 3 lines.....3201-3203 inclusive.

That message was as important as it was artful. :-)
But something was definitely missing -- I am shocked by the absense of color tags.

Rhetorical question, hello?

And why should this be curious? Or magnificent? With even powers of 2, usually, 3 is not stable, it is coming and going. That is because no mersenne with odd exponent is divisible by 3. The case we should worry about is a 3 with an odd power of two, as all mersenne with even expos are divisible by 3. See for example 2^1*3, 2^3*3 (with/without *5), or 2^5*3(at ^1 or ^2, with or without 7) etc.

Examples (from my reserved sequences): [URL="http://factorization.ath.cx/sequences.php?se=1&eff=2&aq=225900&action=last20&fr=0&to=100"]225900[/URL], [URL="http://factorization.ath.cx/sequences.php?se=1&eff=2&aq=865152&action=last20&fr=0&to=100"]865152[/URL], [URL="http://factorization.ath.cx/sequences.php?se=1&eff=2&aq=996666&action=last20&fr=0&to=100"]996666[/URL], etc.

[QUOTE=Batalov;298758]Rhetorical question, hello?[/QUOTE]Goodbye?

[QUOTE=LaurV;298759]And why should this be curious? Or magnificent? With even powers of 2, usually, 3 is not stable, it is coming and going. That is because no mersenne with odd exponent is divisible by 3. The case we should worry about is a 3 with an odd power of two, as all mersenne with even expos are divisible by 3. See for example 2^1*3, 2^3*3 (with/without *5), or 2^5*3(at ^1 or ^2, with or without 7) etc.

Examples (from my reserved sequences): [URL="http://factorization.ath.cx/sequences.php?se=1&eff=2&aq=225900&action=last20&fr=0&to=100"]225900[/URL], [URL="http://factorization.ath.cx/sequences.php?se=1&eff=2&aq=865152&action=last20&fr=0&to=100"]865152[/URL], [URL="http://factorization.ath.cx/sequences.php?se=1&eff=2&aq=996666&action=last20&fr=0&to=100"]996666[/URL], etc.[/QUOTE]

...or 500+ lines of the 2*3 driver in sequence 10212. (sometimes mutated to 2*3^n with n>1 for a few lines, but never getting rid of the driver)

Exactly. As long as it doesn't get a seven, 2^2 is a beauty! :smile: No matter if 3 or not 3.