Reserved for MF - Sequence 4788

[mshelikoff]

The link in my last post included a link to the 4788 stays-under-a-million genealogy at http://www.rieselprime.de/Others/4788_1000000.png .

[science_man_88]

Originally Posted by mshelikoff

The link in my last post included a link to the 4788 stays-under-a-million genealogy at http://www.rieselprime.de/Others/4788_1000000.png .

okay well what else do you want ? the last sequence I quoted was 1001880 but it eventually goes under 1000000 and hits 8092 which merges with 4788

[mshelikoff]

Nevermind.

[science_man_88]

Originally Posted by rajula

And so we are below 150. Soon this will become fast, and hopefully until the end!

at 140 digits now

[Raman]

Aliquot Sequence 4788 is now at 135 digits... which means that if it will go far low then its progress can be made faster.

Only one day taken - Aliquot Sequence 4788 - 150 digits - 140 digits.

Aliquot Sequence 933436 is the longest computed sequence at 12559 iterations. Aliquot Sequence 314718 is following it at 12092 iterations. Seems that it will overtake aliquot sequence 933436 sooner.
Like India population is following China population. When ever do you think that India's population will overtake China's population?
Aliquot Sequence 11040 had been under downdriver for a while, but it is now stable, without a driver, but having a guide, under the influence of it. Who is pursuing aliquot sequence 11040?
Of the open end aliquot sequences below 10000, the aliquot sequences 552, 564, 660, 1512, 1992, 4788, 5250, 9120 are stable, not under (without) the influence of a driver at all.
Aliquot Sequence 4788 was once had been stable, without (not under) the influence of a driver at all, but it has now acquired the downdriver, and now it has fallen down up from 200 digits to 135 digits, and then counting if...
Aliquot Sequence 4788 acquired downdriver all at 175 digits and then 200 digits.

Are there being no new aliquot sequence terminations since Thursday, 23 April 2015? Or Wolfgang Creyaufmüller went "Missing In Action", for a while,
just like Wilfred Keller, for a while?

What is the probability that the aliquot sequence 4788 at this moment would terminate?
It would be very interesting if it would catch into a very big cycle - 16100 loop back again.
ever ever ever ever ever ever ever ever ever ever ever ever ever ever ever ever ever

Originally Posted by ryanp

The c196 on index 5283 (1742276725...) looks to be a tough nut to crack. I've already run 10K curves at B1=26e7 and another 10K at B1=76e8, but no luck so far.
Everyone else is encouraged to run curves too... I will be starting GNFS soon.

a an the this that that which these those is was are were who why whom whose how where what which when ever
How many resources do you have? You are able to crack a p196 very quickly!
. is frequently often misused for multiplication, although it has got a special meaning with in - the decimal point.
Are you working out with in university resources? What university? What post / position are you with in?
Well, let me know very well about this thing around - variably.
think stuff style item step idea

Originally Posted by henryzz

1 mod 4 so 50% chance of raising the power of 2

that ever which ever a way a way
If a line factors as 2².c196 where c196 is congruent to 1 (mod 4), and then 50% of raising the power of 2 only if the 196 digit composite cofactor has got only exactly two prime factors.
How do you say with certainty before hand that the 196 digit composite cofactor has got only exactly two prime factors?
If given the amount of ECM curves done, and then it should have been evident.

By the way, if a line factors as 2^m.x,
with in the next iteration, power of 2 will become 1 if x is a prime congruent to 1 (mod 4)
Let x = p₁^{a[sub]1[/sub]}.p₂^{a[sub]2[/sub]}...p_n^{a[sub]n[/sub]}
Let t be the highest power of 2 dividing (1+p₁+p₁²+...+p₁^{a[sub]1[/sub]}).(1+p₂+p₂²+...+p₂^{a[sub]2[/sub]})...(1+p_n+p_n²+...+p_n^{a[sub]n[/sub]})
= ((p₁^{a[sub]1[/sub]+1}-1)/(p₁-1)).((p₂^{a[sub]2[/sub]+1}-1)/(p₂-1))...((p_n^{a[sub]n[/sub]+1}-1)/(p_n-1))
With in the next iteration, power of 2 will decrease to t if t < m.
With in the next iteration, power of 2 will increase if t = m.
With in the next iteration, power of 2 will remain same at m if t > m.
@ ramshanker - How old are you at all ??

Originally Posted by unconnected

...and now we have squared 3

that which they are being as like into that which it is being as like into
3 is not a component of driver, only let alone a stable guide as long as the power of 2 stays / remains all at an even number. No need to worry about it at all.
3 is preserved due to the prime factors other than 2, which are congruent to 2 (mod 3), that which they are being raised to an odd power, as long as the power of 2 is staying / remaining all at an even number.
3 will disappear if there are no prime factors congruent to 2 (mod 3), that which they are being raised to an odd power, and then if they can re-appear if the same condition occurs back again.
and then if only let alone assuming c has got two prime factors and then if only let alone assuming c has got two prime factors
The only way to escape the 2.3 driver is to have a line factoring / factorizing as like into 2.3^2m.p where by m ≥ 1, p is being a prime number congruent to 1 (mod 4).
and then if only let alone assuming p has got one prime factor and then if only let alone assuming p has got one prime factor
On the other hand, lines factoring / factorizing as like into 2^m.3^k.x where by m ≥ 2, k ≥ 1
3 can be escaped, power of 2 can be mutated if t ≤ m, (and then t as defined as statement that which it is being mentioned above),
If the power of 3 is being an even number, and then it already gives away with a value of t at least is being ≥ 2.
By the way, any way, the aliquot sequence computation algorithm is being a deterministic algorithm - not - not - is being a randomized algorithm.
and then if only let alone assuming c has got two prime factors and then if only let alone assuming c has got two prime factors
By the way, if a line factors as 2^3m-1±1.7^k.c, or, where by m ≥ 1, k ≥ 1, and then if c is being a composite number,
and then if only let alone assuming c has got two prime factors,
with in the next iteration, 7 will disappear with a given fixed probability of
5/6 if c ≡ 1 (mod 7)
2/3 if c ≡ 2, 3, 4, 5, 6 (mod 7)
and then if they can re-appear if the same condition occurs back again.
and then if only let alone assuming p has got one prime factor and then if only let alone assuming p has got one prime factor
By the way, if a line factors as 2^3m-1±1.7^k.p, or, where by m ≥ 1, k ≥ 1, and then if p is being a prime number,
and then if only let alone assuming p has got one prime factor,
with in the next iteration, 7 will disappear with a given fixed probability of
0 if p ≡ 6 (mod 7)
1 if p ≡ 1, 2, 3, 4, 5 (mod 7)
and then if they can re-appear if the same condition occurs back again.

By the way, the future population clock / watch, what ever do you think will happen - fit the best? High Projection? Medium Projection? Low Projection? Why?

By the way, why the last page of the mersenne forum thread / post is - not - not - being shown some times?

Down up from 200 digits to 135 digits, and then counting if...

[henryzz]

We dodged a bullet at iteration 5657. 2*p. 50% chance of losing down driver.

Raman we didn't know that it only had 2 factors for certain. However we were pretty certain based upon ecm.
Please stop using white text I didn't notice on my first read through. Next time you do it on this subforum it will be edited to be clearer.

[VBCurtis]

Why not edit it now? I vote for a temporary ban if he continues to use white text. Not acceptable.

[rajula]

Originally Posted by VBCurtis

Why not edit it now? I vote for a temporary ban if he continues to use white text. Not acceptable.

Didn't Batalov just warn Raman for such behavior? (or was it for something else?) In any case, the white text does irritate.

On a positive note: now below 120 digits and going down fast.

[unconnected]

115 digits!
105 ~30min later

[science_man_88]

Originally Posted by unconnected

115 digits!

113 actually right now ( just refreshed my screen).

edit:and now about 108 ... 105,

[mshelikoff]

I'm still writing about this topic after I wrote "nevermind," so I apologize for writing "nevermind" because obviously I'm still thinking about it, and I'm fairly new to the forum and might be making a mistake by asking this question now. But...

What are the odds of this sequence meeting itself and creating a very large cycle if the sequence dips below a given number of digits (I'll use 7) and then terminates? Maybe it's an unlikely precondition before even considering the chances of the event if the precondition takes place. But I'm curious about it and wondering if I'm thinking about it the right way. I'm not talking about when a merger is found but how the final sequence at factordb will appear.

If the count of non-untouchable numbers above 10^7 with an immediate descendant below 10^7 were used as a denominator and the count of the subset of those numbers that belong to the 4788 genealogy were used as the numerator, would that fraction give a reasonable estimate of the odds?

I'm using the word "odds" as if this were a horse race instead of the given fixed probabilities in Raman's post, but that seems to be part of the appeal of following these things.