thefourtheye.in

Project Euler Problem 14 - Longest Collatz sequence. Demonstrates memoization to dramatically speed up computing chain lengths for the Collatz conjecture.

Project Euler Problem 5 - Smallest Multiple. Finds the smallest number divisible by all numbers 1-20. Compares brute force approach to optimized LCM-based solution using GCD.

Covers multiple algorithms for testing primality - from basic O(n) trial division to optimized approaches checking only up to square root, and skipping even numbers after 2.