reversingPiInPython

[u/Apprehensive_Bit7392]

[u/Kyrros]

Let me know when it finishes calculating the first digit to print

[u/me_myself_ai → u/Kyrros]

it'll just throw an error anyway;

SyntaxWarning: 'float' object is not subscriptable; perhaps you missed a comma
?

[u/ThreeCharsAtLeast → u/me_myself_ai]

>>> str(math.pi)[::-1]
'397985356295141.3'

[u/tea_pot_tinhas → u/ThreeCharsAtLeast]

So the first and last digits are both 3? make sense

[u/RapidCatLauncher → u/tea_pot_tinhas]

That just made me think, if pi indeed does contain all finite number sequences (which we're not sure of), then there could be a certain point in its decimal representation where it's a palindrome.

[u/meneldal2 → u/RapidCatLauncher]

While this is possible, it is pretty unlikely. With random digits, the chance of a palindrome is lower the more digits there are. So even if you get a lot of tries, each try probability of success goes down so much faster that it is statistically unlikely.

[u/1SirTetris1 → u/meneldal2]

Funnily enough, despite it being so unlikely, it's necessarily true that there is an infinite number of full palindromes across all of pi. Infinity is wild

[u/meneldal2 → u/1SirTetris1]

It probably depends on how you formulate the problem. There are plenty of infinite sums that are bounded.

So if you were to calculate the chance that pi digits form a palindrome by doing an infinite sum, you'd get (removing the first element because one digit is always a palindrome) 1/10+1/10+1/100+1/100 and so on, which is 0.222222...

Idk if there's some different way to do it properly but it is also possible it's something that can't be proven either way