Question 1: The Collatz Conjecture
Consider the following sequence of numbers:
Start with any positive integer n.
If n is even, divide it by 2 to get n/2.
If n is odd, multiply it by 3 and add 1 to get 3n + 1.
Repeat the process indefinitely for the resulting values, and the conjecture states that no matter which positive integer you start with, eventually you will reach the number 1.
The question is: Can you prove or disprove the Collatz Conjecture? In other words, can you prove that the sequence will always reach the number 1 for any positive integer n?
In Mathematics
2 Answers Available
Asked by Låwson on 8th June, 2023
Ask Your Own Question
Quick Questions
See More Mathematics Questions
Answers ({{ comment_count }})
Please wait...
Modal title
Report
Block User
{{ feedback_modal_data.title }}