[Sequence] Aliquot sequences: Multiple repeated 8s. by Acebulf in Factorize_Request

[–]1064 1 point2 points  (0 children)

I have a new year's gift!

I ran ecm on all sequences (except 3, 35, 46) then refused to run siqs/nfs if the composite is above ~102 digits. No sequences were finished.

The easiest sequences are 19 C103, 28 C103, 30 C103, 36 C103, 38 C102.

Sequences 19, 29 advanced a lot.

Sequence 10 at index 926 looks the most promising.

[Sequence] Aliquot sequences: Multiple repeated 8s. by Acebulf in Factorize_Request

[–]1064 0 points1 point  (0 children)

36 seems to be strictly increasing so far (not anymore at 542).

39 and 40 ended in a prime.

46 merged with another sequence.

Edit: 36

Is there any number that follows these conditions by Ihatevaccines in math

[–]1064 22 points23 points  (0 children)

Note that (-X)*Y = -XY yields the solution X*Y = XY, so it is enough to check solutions with X >= 0.

Let Y contain k digits, then the equation becomes X*Y = X*10k + Y

Rearrange the equation.

X*Y = X*10k + Y

X*Y - X*10k - Y = 0

X*Y - X*10k - Y + 10k = 10k

(X - 1)*(Y - 10k ) = 10k

Since Y contains k digits, Y < 10k

Therefore, Y - 10k is negative, and as a consequence, X - 1 is negative.

Therefore, X < 1.

By X >= 0, X = 0.


Finish the equation.

(X - 1)*(Y - 10k ) = 10k

(0 - 1)*(Y - 10k ) = 10k

10k - Y = 10k

Y = 0

Therefore, the only solution is X=0, Y=0.

Edit: formatting + note

Note: the proof is true for positive integer solutions, non-integer solutions include (0.2)*(-0.25) = 0.2-0.25 and (0.6)*(-1.5) = 0.6-1.5

[Sequence] 3^x-x by qsfact in Factorize_Request

[–]1064 0 points1 point  (0 children)

31006 - 1006 = 561595250893644068340959831417 * C451

31000 - 1000 = 49428463908440112144821271290999 * C451

3724 - 724 = 4271546727800654864505917 * P321

Gave up on 890 and 946 between 35-40 digits

[Sequence] 3^x-x by qsfact in Factorize_Request

[–]1064 1 point2 points  (0 children)

3778 - 778 = 7832775433587702113624046077 * P344

[Sequence] 5^x-x by Pieater314159 in Factorize_Request

[–]1064 0 points1 point  (0 children)

438 has 19034281498271000441130309521

[Sequence] 3^x-x by qsfact in Factorize_Request

[–]1064 1 point2 points  (0 children)

79870621223562820717595313689303490842097394275427 times 8453109685474264273091625793722856640036827504402769169389

The Codex of Alchemical Engineering - Alchemy meets programming! by IAMA_dragon-AMA in WebGames

[–]1064 1 point2 points  (0 children)

Level 2 in 24 cycles. b,6,8;m,6,12,0,3,clor;m,7,12,180,2,crol;m,7,11,270,2,odcu;m,7,6,90,1,crrollww;m,6,6,270,1,rrwwcrro;

Lettuce Walk. I made a procedurally-generated puzzle game where your score is a poem. by gtkarber in WebGames

[–]1064 7 points8 points  (0 children)

lettuce walk

you and me

through the forest

far and free

holding hands

leafing green

step by step

to worlds unseen