Summary
Hello everyone. I am trying to solve a -relatively easy- problem, related to the Collatz Conjecture.
First and foremost, the problem reads as follows:
The following iterative sequence is defined for the set of positive integers:
n → n/2 (n is even) n → 3n + 1 (n is odd)
Using the rule above and starting with 13, we generate the following sequence:
13 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → 2 → 1 It can be seen that this sequence (starting at 13 and finishing at 1) contains >10 terms. Although it has not been proved yet (Collatz Problem), it is thought >that all starting numbers finish at 1.
Which starting number, under one million, produces the longest chain?
NOTE: Once the chain starts the terms are allowed to go above one million.
Source: https://projecteuler.net/problem=14
A short footnote
Initially, I did have problems with my variables overflowing and becoming negative. Although, I fixed that by using unsigned long long, as I mentioned.
Code
#include <iostream>
using namespace std;
int collatz(long long n) {
if (n%2 == 0) return n/2;
return 3*n+1;
}
int main() {
unsigned long long cnt, n, maxcnt=0, num;
for(int i=1; i<1000000; i++) {
cnt=1;
n=i;
while(n != 1) {
n=collatz(n);
cnt++;
}
if(cnt>maxcnt) {
maxcnt=cnt;
num=i;
}
}
cout<<num;
return 0;
}
Result
Instead of getting any result, it just ends up in an infinite loop.