A Week Later, I Found a Fabulously Inelegant Solution
This one took a long time to figure out. I started last Sunday and finally got an answer today. Based on how busy my life… Read More »A Week Later, I Found a Fabulously Inelegant Solution
This one took a long time to figure out. I started last Sunday and finally got an answer today. Based on how busy my life… Read More »A Week Later, I Found a Fabulously Inelegant Solution
Overview The fourth problem set asked to find the largest palindrome as a product of two numbers of size N (specified in the problem). A… Read More »Palindromes like Mom, Dad, and ABBA, but as Numbers
Overview The third Euler Project Problem asks you to decompose a large integer to find its largest prime factor. Sounds simple enough. However, it took… Read More »The Loops of Prime Factorization Took Me for a Drive
The Problem It’s time for the second Project Euler problem set! The problem requires finding the even Fibonacci Sequence numbers below 4,000,000. I calculated the… Read More »Finding Even Fibonacci Numbers Below a Threshold
I first heard of Project Euler about a week ago on a Twitter thread I’ve since lost. It excited me enough to get started! I wish I knew about it earlier because the way these are set up provides ample opportunity to develop good computing intuition. I plan to do one of these a week. I’ll be posting my code with explanations on this blog for the first 100 problems