Project euler solutions
|
|
||
|---|---|---|
| .vscode | ||
| resources | ||
| src | ||
| .gitignore | ||
| build | ||
| Cargo.lock | ||
| Cargo.toml | ||
| euler.png | ||
| readme.md | ||
euler
My solutions to many of Project Euler's problems.
All of the solutions here are written in rust. main.rs is the home to my helper command line that can scaffold files for me quickly, prefaced with a statement of the problem! As per the rules of the challenge, I may only publish the solutions to the first 100 problems here, so I will stop after that but still continue the challenge.
I originally started the challenge in the-honk in TypeScript, and am currently in the process of porting over all of my already completed challenges. Check out my old work here.
Challenge Completion
21 out of 100 public challenges completed.
- 1 - Multiples of 3 or 5
- 2 - Even Fibonacci numbers
- 3 - Largest prime factor
- 4 - Largest palindrome product
- 5 - Smallest multiple
- 6 - Sum square difference
- 7 - 10001st prime
- 8 - Largest product in a series
- 9 - Special Pythagorean triplet
- 10 - Summation of primes
- 11 - Largest product in a grid
- 12 - Highly divisible triangular number
- 13 - Large sum
- 14 - Longest Collatz sequence
- 15 - Lattice paths
- 16 - Power digit sum
- 17 - Number letter counts
- 18 - Maximum path sum I
- 19 - Counting Sundays
- 20 - Factorial digit sum
- 21 - Amicable numbers
- 22 - Names scores
- 23 - Non-abundant sums
- 24 - Lexicographic permutations
- 25 - 1000-digit Fibonacci number
- 26 - Reciprocal cycles
- 27 - Quadratic primes
- 28 - Number spiral diagonals
- 29 - Distinct powers
- 30 - Digit fifth powers
- 31 - Coin sums
- 32 - Pandigital products
- 33 - Digit cancelling fractions
- 34 - Digit factorials
- 35 - Circular primes
- 36 - Double-base palindromes
- 37 - Truncatable primes
- 38 - Pandigital multiples
- 39 - Integer right triangles
- 40 - Champernowne's constant
- 41 - Pandigital prime
- 42 - Coded triangle numbers
- 43 - Sub-string divisibility
- 44 - Pentagon numbers
- 45 - Triangular, pentagonal, and hexagonal
- 46 - Goldbach's other conjecture
- 47 - Distinct primes factors
- 48 - Self powers
- 49 - Prime permutations
- 50 - Consecutive prime sum
- 51 - Prime digit replacements
- 52 - Permuted multiples
- 53 - Combinatoric selections
- 54 - Poker hands
- 55 - Lychrel numbers
- 56 - Powerful digit sum
- 57 - Square root convergents
- 58 - Spiral primes
- 59 - XOR decryption
- 60 - Prime pair sets
- 61 - Cyclical figurate numbers
- 62 - Cubic permutations
- 63 - Powerful digit counts
- 64 - Odd period square roots
- 65 - Convergents of e
- 66 - Diophantine equation
- 67 - Maximum path sum II
- 68 - Magic 5-gon ring
- 69 - Totient maximum
- 70 - Totient permutation
- 71 - Ordered fractions
- 72 - Counting fractions
- 73 - Counting fractions in a range
- 74 - Digit factorial chains
- 75 - Singular integer right triangles
- 76 - Counting summations
- 77 - Prime summations
- 78 - Coin partitions
- 79 - Passcode derivation
- 80 - Square root digital expansion
- 81 - Path sum: two ways
- 82 - Path sum: three ways
- 83 - Path sum: four ways
- 84 - Monopoly odds
- 85 - Counting rectangles
- 86 - Cuboid route
- 87 - Prime power triples
- 88 - Product-sum numbers
- 89 - Roman numerals
- 90 - Cube digit pairs
- 91 - Right triangles with integer coordinates
- 92 - Square digit chains
- 93 - Arithmetic expressions
- 94 - Almost equilateral triangles
- 95 - Amicable chains
- 96 - Su Doku
- 97 - Large non-Mersenne prime
- 98 - Anagramic squares
- 99 - Largest exponential
- 100 - Arranged probability
Check out Project Euler here.