The conjecture is 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 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.“
Professor Lawrence Tao from UCLA proved that “almost all Collatz orbits attain almost bounded values“.
Following is nice video on the Collatz conjecture:
- Quanta Magazine: “Computer Scientists Attempt to Corner the Collatz Conjecture“
- MIT Technology Review: “Are computers ready to solve this notoriously unwieldy math problem?“
Note: The picture above is from the YouTube video above.
Copyright © 2005-2021 by Serge-Paul Carrasco. All rights reserved.
Contact Us: asvinsider at gmail dot com