## Intro

Take any positive integer, n. If n is even divide it by 2 (n/2). If n is odd multiple by 3 and add 1 (3n+1). Repeat the process on the new value. The Collatz Conjecture is that this sequence will eventually reach 1 (or more accurately will get stuck in the loop 4 -> -> 2 -> 1 -> 4). The routes from n to 1 can be visualised as a graph (modified from here).

While this display is informative, prettier visualisations of many more numbers are possible (inspired by this YouTube video).

## Visualisation

The R code (link below) generates a graph of all numbers between 1 and the highest value (bigNumber in the script). When plotting the graph edges ending in an even number are plotted slightly anti-clockwise from the previous node, and odd numbers are plotted slightly clockwise. The amount of anti-clockwise rotation does not need to be the same as the amount of clockwise rotation, which allows the overall graph to be plotted relatively straight, and careful choice of values will prevent lines performing complete revolutions.

The graph is plotted just using R plot primitives (`segments()`

) rather than any other package.

n=1-5000, odd-rotation=1.2, even-rotation=-0.54

n=1-50000, odd-rotation=4.1, even-rotation=-2.3

## Code

The code is available on GitHub: Collatz Conjecture visualisation in R.

## Trivia

- Google Image Search seems to think that the graph is a feather
- UNCRACKABLE? The Collatz Conjecture - Numberphile