  We give a short proof of Belaga's result on bounds to perigees of
$(3x+d)$-cycles of a given oddlength. We also reformulate the Collatz cycle
conjecture which is rather a algorithmic problem into a purely arithmetic
problem.
