Table of Contents

1. About The Collatz Conjecture
2. Documentation
   • Compile
   • Issues
   • Basic Infos
   • Functions

Collatz Conjecture Viewer

"The Collatz conjecture in mathematics asks whether repeating certain simple arithmetic operations will eventually transform every positive integer into one. It concerns sequences of integers in which 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 these sequences always reach 1, no matter which positive integer is chosen to start the sequence."
It is also known as the /3n + 1/ problem. Source

Documentation

compiling

theres nothing extra in it, just use
g++ Main.cpp -o collatz or g++ Main.cpp -o collatz.exe

known stuff, i'll fix them one day

• numbers that eventually exceed the integer limit, will crash the program
• negative numbers, fractions have cool effects
• anything that is not a number will annihilate the program
• entering too big numbers cause the program to literally die

basics

i have no experience in GUIs, so everything is text based
IF YOU ENTER ANYTHING THAT IS NOT A NUMBER, it will crash the program
in the menu, type the number of the function you want to use, then press ENTER
after each function executes, you're prompted to press ENTER (do it after you mesmerized yourself with the result)

functions

[0] EXIT

exits the program

[1] Reduce to 1:

calculates the whole sequence until 1
outputs how many steps it require to hit 1, and the highest number the sequence reached
requires only one input (X), which can be any number¹
example:

X >> 7
Print out sequence? (Y/N) >> y
7 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1  
Your input (7) took 16 steps to reduce
Highest Number: 52

[2] Graph X's sequence

not yet implemented

[3] Calculate X steps in Y's sequence:

calculates X steps of the whole sequence
outputs the Xth number
requires two inputs: base number (Y), which can be any number¹, and X, the number of sequences example:

Y >> 7
X >> 3
After 3 step(s), the input (7) caused a result of 34

[4] Search for X in Y's sequence:

goes through Y's the sequence until X is found
either outputs how many steps does it required to get to X or tells the user that it's impossible to get to X
requires two inputs: base number (Y), which can be any number¹, and X, the number you're looking for in Y's sequence
example:

Y (Base Number) >> 69
X >> 4
The number '4' occurs after 12 step(s) in the collatz-sequence of 69

Footnotes

1. numbers above 0, or any number which sequence doesn't go above the limits (i guess above 2^64, im not entirely sure) ↩ ↩² ↩³