https://github.com/ijsbol/collatz-conjecture

A visual demonstration of Collatz Conjecture
https://github.com/ijsbol/collatz-conjecture

Last synced: 2 days ago
JSON representation

A visual demonstration of Collatz Conjecture

• Host: GitHub
• URL: https://github.com/ijsbol/collatz-conjecture
• Owner: ijsbol
• Created: 2021-08-02T21:04:35.000Z (over 3 years ago)
• Default Branch: main
• Last Pushed: 2021-08-02T21:13:04.000Z (over 3 years ago)
• Last Synced: 2025-01-01T00:25:49.988Z (8 days ago)
• Language: Python
• Size: 1.95 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# Collatz Conjecture - Python

> *The **Collatz conjecture** is a [conjecture](https://en.wikipedia.org/wiki/Conjecture) in [mathematics](https://en.wikipedia.org/wiki/Mathematics "Mathematics") that concerns [sequences](https://en.wikipedia.org/wiki/Sequence "Sequence") defined as follows: start with any [positive integer](https://en.wikipedia.org/wiki/Positive_integer "Positive integer")  $n$. Then each term is obtained from the previous term as follows: if the previous term is [even](https://en.wikipedia.org/wiki/Parity_(mathematics) "Parity (mathematics)"), the next term is one half of 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.* [**Read more**](https://en.wikipedia.org/wiki/Collatz_conjecture)

*Long story short, I got bored and decided to program a random maths thing.*