## Euler #18: Maximum Path Sum

Taking paths through triangles is actually more glamorous than it seems. Shortest/longest paths are a common problem in graph theory. And the cool thing about graphs? They’re EVERYWHERE.

Imagine you’re stuck in a grid of one-way streets. How many ways are there to get from one corner to the other? What idiot designed such a city?

Proving the Collatz Conjecture is still an unsolved problem of mathematics. This post doesn’t try to do that. Instead, it descends down the tree of a million numbers to the root of all numbers: 1.