Admin: Created page with "Problem link: https://projecteuler.net/problem=14 The Collatz sequence, also called a hailstone sequence, is a sequence of numbers determined by two formulas, applied dependi..."

2017-07-15T07:59:07Z

Created page with "Problem link: https://projecteuler.net/problem=14 The Collatz sequence, also called a hailstone sequence, is a sequence of numbers determined by two formulas, applied dependi..."

New page

Problem link: https://projecteuler.net/problem=14

The Collatz sequence, also called a hailstone sequence, is a sequence of numbers determined by two formulas, applied depending on whether the current number in the sequence is even or odd. If a given term in the sequence is odd, the next term is computed using the expression

<math>
n_{i+1} = 3 n_i + 1
</math>

and if it is even, the following formula is used:

<math>
n_{i+1} = \frac{n}{2}
</math>

Eventually, this sequence will begin to repeat. The task for this problem is to compute a Collatz sequence for all of the integers under 1 million, and determine which starting integer leads to the longest Collatz sequence.

As you can probably imagine, the integers in this problem get ''really'' big. I initially began with longs, but when I had finished the implementation and began to run the program, I realized I needed to use BigInteger in my implementation.

{{ProjectEulerFlag}}

Project Euler/14 - Revision history

Admin: Created page with "Problem link: https://projecteuler.net/problem=14 The Collatz sequence, also called a hailstone sequence, is a sequence of numbers determined by two formulas, applied dependi..."