Media Summary: You're literally one click away from a better setup — grab it now! As an Amazon Associate I earn ... By replacing the first digit of the 2-digit number *3, it turns out that six of the nine possible values: 13, 23, 43, 53, 73 and 83 are all ... In this video I show a technique for efficiently checking if two numbers contain the same digits. https://
Project Euler Problem 51 C - Detailed Analysis & Overview
You're literally one click away from a better setup — grab it now! As an Amazon Associate I earn ... By replacing the first digit of the 2-digit number *3, it turns out that six of the nine possible values: 13, 23, 43, 53, 73 and 83 are all ... In this video I show a technique for efficiently checking if two numbers contain the same digits. https:// In this video we use our Primes class to search for primes which only give another prime when truncated from the left or from the ... In this video we look at an algorithm that seems to have excellent performance in-practice, but proving it may involve the Riemann ... Finding the ten thousand and first prime number, with
In this video I implement the comparison operators for our Big Int class and use it to solve Short and sweet; like that one girl in college you should've asked out, or shortbread cookies In this video we take advantage of the recent improvements to our BigInt class to search for Lychrel numbers! I demonstrate how to use the Sieve of Eratosthenes to generate prime numbers and solve In this video we use our Primes class to search for primes which can be "rotated" to create other primes! In this video I show how to find the digits of a number, how to represent a number in different bases (binary and hexadecimal), and ...
To be honest, this is probably the lamest Pretty easy/short one, just brute forcing numbers under 1 million by even/odd until they reach 1, and counting the number of terms ... We use our shiny new Primes class to solve
