/* Collatz Conjecture The Collatz conjecture (also known as the Ulam conjecture or the Syracuse problem) is an unsolved mathematical problem, which is very easy to formulate: 1. Take any natural number 2. If it's even, half it, otherwise triple it and add one 3. Repeat step 2. until you reach 4, 2, 1 sequence 4. You will ALWAYS reach 1, eventually. 17 * 3 + 1 = 52 52 / 2 = 26 26 / 2 = 13 13 * 3 + 1 = 40 40 / 2 = 20 20 / 2 = 10 10 / 2 = 5 5 * 3 + 1 = 16 16 / 2 = 8 8 / 2 = 4 4 / 2 = 2 2 / 2 = 1 1 * 3 + 1 = 4 ... That last sequence: 4, 2, 1 is an infinitely repeating loop. The formulated conjecture is that for any x the sequence will always reach 4, 2, 1 ultimately. While the problem cannot be proved, the assignment is to write a code that will produce and print out the whole sequence for an input number. */ #include using namespace std; void collatz ( uintmax_t x ){ size_t it = 1; for ( ; x > 1 ; x = x&1 ? x*3+1 : x/2 ) { cout<< x<<","; ++it; } cout< meta-program templatestruct Collatz{}; templatestruct Collatz{ static const size_t result = 1 + Collatz::result ; }; templatestruct Collatz{ static const size_t result = 1 + Collatz::result ; }; template<>struct Collatz<1>{ static const size_t result =1; }; const uintmax_t number_1 = 8888; const uintmax_t number_2 = 8888888888888888888; int main() { cout<< "number_1 = "<< number_1 << endl << "Result with : " << Collatz::result < : " << Collatz::result <

[LESSON] collatz conjecture