so... perhaps i shouldn't have tried to have a simple recursive function try to calculate the 69th number in the fibonacci sequence
Avatar by Sol
A techie critter and casual streamer in their mid-twenties with interests in webhosting. Known for running web servers on things that shouldn't run web servers, turning others into similar looking blue raccoons, and being a little bit bigger than average.
Disclaimer: All content posted here are my own, and don’t necessarily represent my employer’s positions, strategies, or options.
I post non-lewd kink, but make best efforts to tag it 18+. This might not always happen, however (especially if it's only adjacent to it.) Please only follow if you are 18+.
Additionally, please put something in your profile before following me. I probably won’t block over it or anything, but I get a little anxious when I’m followed by an empty account.
so... perhaps i shouldn't have tried to have a simple recursive function try to calculate the 69th number in the fibonacci sequence
good luck! if you can stick with it and learn to understand rustc's, uh, let's call it "love language", you might just become scarily effective in ways you didn't know you could be :p
yeah, definitely bigger than 32 bits, just checked in termux on my phone lol
>>> def f(n):
... x = 0
... y = 1
... while n > 0:
... x, y = (y, x+y)
... n -= 1
... return x
...
>>> print(f(69))
117669030460994
>>> 1<<32
4294967296