Created
October 23, 2015 20:41
-
-
Save deniskyashif/1280fcd651bd9022895c to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* 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. */ | |
using System; | |
class Program | |
{ | |
static void Main() | |
{ | |
const long MaxNum = (long)1e+6; | |
ulong maxLength = 0; | |
ulong bestStartingNum = 0; | |
var membersForStartingNum = new ulong[MaxNum + 1]; | |
membersForStartingNum[1] = 1; | |
ulong num; | |
ulong length; | |
for (ulong i = 2; i <= MaxNum; i++) | |
{ | |
num = i; | |
length = 1; | |
while (num != 1) | |
{ | |
if ((num & 1) == 0) | |
{ | |
num /= 2; | |
} | |
else | |
{ | |
num = 3 * num + 1; | |
} | |
if (num < MaxNum && membersForStartingNum[num] != 0) | |
{ | |
length += membersForStartingNum[num]; | |
break; | |
} | |
length++; | |
} | |
membersForStartingNum[i] = length; | |
if (length > maxLength) | |
{ | |
maxLength = length; | |
bestStartingNum = i; | |
} | |
} | |
Console.WriteLine(bestStartingNum); | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment