siddhantchimankar / collatz-conjecture

Analysis over a self-generated dataframe to find insights into the famous conjecture

Collatz-Conjecture

Project : Analyze the Collatz conjecure by performing visualisations over a 10,000 x 13 self-generated dataframe.

Language : Python 3.7

Description :

The Collatz conjecture is a conjecture in mathematics that concerns a sequence defined as follows: start with any positive integer n. Then each term is obtained from the previous term as follows: if the previous term is even, the next term is one half the previous term. If the previous term is odd, the next term is 3 times the previous term plus 1. The conjecture is that no matter what value of n, the sequence will always reach 1.

The conjecture is named after Lothar Collatz, who introduced the idea in 1937, two years after receiving his doctorate.[1] It is also known as the 3n + 1 problem, the 3n + 1 conjecture, the Ulam conjecture (after Stanisław Ulam), Kakutani's problem (after Shizuo Kakutani), the Thwaites conjecture (after Sir Bryan Thwaites), Hasse's algorithm (after Helmut Hasse), or the Syracuse problem.[2][4] The sequence of numbers involved is sometimes referred to as the hailstone sequence or hailstone numbers (because the values are usually subject to multiple descents and ascents like hailstones in a cloud),[5][6] or as wondrous numbers.[7]

Resources :

https://en.wikipedia.org/wiki/Collatz_conjecture
https://www.youtube.com/watch?v=5mFpVDpKX70
https://www.youtube.com/watch?v=LqKpkdRRLZw
https://www.youtube.com/watch?v=K0yMyUn--0s