collatz-problem - Systemantics

UVa 371. Ackermann Function

14 Mar 2013 1 min read ad-hoc

The underlying concepts of UVa 371: Ackermann Functions have been discussed in great details in our post of Collatz problem. In this post, we simply outlines an ad-hoc algorithm as a solution

UVa 100. The 3n+1 Problem: Solving with a Brute-force Algorithm

21 Feb 2013 1 min read brute-force

The UVa 100: The 3n+1 Problem is about collatz problem, which we have discussed in details in a recent post. The following Java code describes a brute-force algorithm to solve this

Collatz Problem a.k.a. 3n+1 Problem

20 Feb 2013 6 min read Algorithm

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