Description: Euler project, find the longest series! Define a positive integers, the iterative formula: n = n/2 (when n is even) n = 3n+1 (when n is odd), n = 13 for example, from the beginning, this series was calculated: 13-> 40-> 20-> 10-> 5-> 16-> 8-> 4-> 1 this series a total of 10 items. Requires less than 1 million threshold in all, which few can produce the longest series.
To Search:
File list (Check if you may need any files):
Euler Engineering.doc
Download