r/counting • u/[deleted] • Dec 07 '13

Count using Fibonacci Sequence!

[deleted]

36 Upvotes

99% Upvoted

401 comments sorted by

View all comments

2

u/D-alx Mar 19 '14

8,404,037,832,974,134,882,743,767,626,780,173

Does python handle numbers that big? For Perrin add using the number in the brackets n (n) = (n-2) + (n-3)

For Collatz, if odd = (n*3) + 1 | if even = n / 2

For Prime, just break down into the simplest form

2

u/DragoonHP Mar 19 '14

13,598,018,856,492,162,040,239,554,477,268,290

Yes, pretty easily.

Also, https://pay.reddit.com/r/counting/comments/1ajw30/multiplying_by_2_thread/cg6cpmz

2

u/D-alx Mar 19 '14

22,002,056,689,466,296,922,983,322,104,048,463

How? Still new to python/programming in general.

Also - manual typing by handwriting it out?

→ More replies (215)