This post focuses on
Collatz problem, which is also known as, among others, the
3n+1 problem, and the Syracuse problem.
Outline. We begin by introducing
Collatz conjecture; afterwards, we presents an
algorithm to solve the
problem (UVa 100
or
SPOJ 4073) published in both
UVa
and SPOJ.
The primary advantage of having it in SPOJ is that we can use
F# to derive a simple and elegant solution; at the same time,
we can verify it via SPOJ's online judge...continue reading.