Step-By-Step Collatz Sequence #2843 #2845
Merged
+18
−24
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
🔹 Collatz Sequence Problem
The Collatz sequence (also called the 3n + 1 problem) is a simple mathematical process:
1. Start with any positive integer n.
2. If n is even, divide it by 2 → n = n / 2.
3. If n is odd, multiply it by 3 and add 1 → n = 3n + 1.
4. Repeat this process with the new value of n.
5. Eventually (for all tested numbers), the sequence will reach 1.
Explaining the code part:
Description
When the user enters a non-integer (like "abc"), the program raises a ValueError and exits immediately. It would be better if the program handled this by showing an error message and requesting valid input again.