[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math

View post   
File: 23 KB, 311x340, collatz_xkcd.jpg [View same] [iqdb] [saucenao] [google]
15315655 No.15315655 [Reply] [Original]

The 3n+1 problem has probably been solved.

http://dx.doi.org/10.13140/RG.2.2.28030.46409

>> No.15315708

If it was solved the author would not have given the paper such an unpretentious title.

>> No.15315714

>>15315655
3^k >= 9^(k−2)
lol

>> No.15315720

>>15315708
Google "proof of collatz" and you'll know why the author chose a different title.

>> No.15315758
File: 15 KB, 539x281, Screenshot_20230331_225900_Chrome.jpg [View same] [iqdb] [saucenao] [google]
15315758

>>15315714
Yes, lol indeed.

>> No.15315769

n = -1/3. Easy

>> No.15315870

>>15315655
It could be proven by restating in binary:
if the least significant bit is zero, shift to the right.
if the least significant bit is one, shift to the left with one in the least significant bit and add to itself.
Now, shifting to the right obviously changes neither the number, nor the pattern of ones.
Next, what does it take for the number of ones to increase? It takes an one, surrounded by two zeros:
000000010000000100000001
000000100000001000000011
000000110000001100000100

000000001100000011000001
000000011000000110000011
000000100100001001000100

000000001001000010010001
000000010010000100100011
000000011011000110110100


This will always remove the less significant zero, until the pattern collapses, and the ones decrease.

>> No.15315888

>>15315870
Binary is momentum generation. Quantum Computers aren't computers, they're advanced momentum generators. Lick my balls compufag

>> No.15315909

>>15315870
I can apply your logic to 3n-1 series for an integer like 3 to get

011 = 3
101 = 2x3-1
1000 =3x3-1

Which will reduce to 1 as well. But 3n-1 series doesn't reduce to 1 for many integers.

>> No.15315919
File: 1.25 MB, 3400x3044, TIMESAND___QDRH762aFF.jpg [View same] [iqdb] [saucenao] [google]
15315919

>>15315655
RH is false

>> No.15315921
File: 943 KB, 1x1, TIMESAND___FractionalDistance.pdf [View same] [iqdb] [saucenao] [google]
15315921

>>15315919
Same proof not relying on Prop 1.8. (Not "quick.")

>> No.15315924
File: 3.19 MB, 3689x2457, TIMESAND___ZetaMedium.jpg [View same] [iqdb] [saucenao] [google]
15315924

An independent proof showing the same result: RH is false.

>> No.15315926
File: 353 KB, 1042x1258, TIMESAND___VERYquickRH.png [View same] [iqdb] [saucenao] [google]
15315926

>> No.15315955

>>15315655
>http://dx.doi.org/10.13140/RG.2.2.28030.46409

>Property 1: Condition for divergence
>By design, the 3n + 1 sequence has an odd step followed by at least one even step. Two odd steps cannot occur in succession, but several even steps can. Therefore, one odd step must be followed by precisely one even step for the
sequence to diverge.

no

>> No.15316593

>>15315655
>This content has been removed by the author
lmao

>> No.15316607

>>15315926
This has to be some sort of custom bot. it's been doing this shit for too long

>> No.15317354

>>15315655
>http://dx.doi.org/10.13140/RG.2.2.28030.46409
>this content has been removed by the author
my advice to the author: check your shit *before* publishing.

>> No.15317401

>>15315655
>be mathfag
>steadfastly refuse to post in the math general
>spam the board with vanity threads instead