Project Euler Full Solutions

Project Euler > Problem 1 > Multiples of 3 and 5 (Java Solution) 
Project Euler > Problem 2 > Even Fibonacci numbers (Java Solution) 
Project Euler > Problem 3 > Largest prime factor (Java Solution) 
Project Euler > Problem 4 > Largest palindrome product (Java Solution) 
Project Euler > Problem 5 > Smallest multiple (Java Solution) 
Project Euler > Problem 6 > Sum square difference (Java Solution) 
Project Euler > Problem 7 > 10001st prime (Java Solution) 
Project Euler > Problem 8 > Largest product in a series (Java Solution) 
Project Euler > Problem 9 > Special Pythagorean triplet (Java Solution) 
Project Euler > Problem 10 > Summation of primes (Java Solution) 
Project Euler > Problem 11 > Largest product in a grid (Java Solution) 
Project Euler > Problem 12 > Highly divisible triangular number (Java Solution) 
Project Euler > Problem 13 > Large sum (Java Solution) 
Project Euler > Problem 14 > Longest Collatz sequence (Java Solution) 
Project Euler > Problem 15 > Lattice paths (Java Solution) 
Project Euler > Problem 16 > Power digit sum (Java Solution) 
Project Euler > Problem 17 > Number letter counts (Java Solution) 
Project Euler > Problem 18 > Maximum path sum I (Java Solution) 
Project Euler > Problem 19 > Counting Sundays (Java Solution) 
Project Euler > Problem 20 > Factorial digit sum (Java Solution) 
Project Euler > Problem 21 > Amicable numbers (Java Solution) 
Project Euler > Problem 22 > Names scores (Java Solution) 
Project Euler > Problem 23 > Non-abundant sums (Java Solution) 
Project Euler > Problem 24 > Lexicographic permutations (Java Solution) 
Project Euler > Problem 25 > 1000-digit Fibonacci number (Java Solution) 
Project Euler > Problem 26 > Reciprocal cycles (Java Solution) 
Project Euler > Problem 27 > Quadratic primes (Java Solution) 
Project Euler > Problem 28 > Number spiral diagonals (Java Solution) 
Project Euler > Problem 29 > Distinct powers (Java Solution) 
Project Euler > Problem 30 > Digit fifth powers (Java Solution) 
Project Euler > Problem 31 > Coin sums (Java Solution) 
Project Euler > Problem 32 > Pandigital products (Java Solution) 
Project Euler > Problem 33 > Digit canceling fractions (Java Solution) 
Project Euler > Problem 34 > Digit factorials (Java Solution) 
Project Euler > Problem 35 > Circular primes (Java Solution) 
Project Euler > Problem 36 > Double-base palindromes (Java Solution) 
Project Euler > Problem 37 > Truncatable primes (Java Solution) 
Project Euler > Problem 38 > Pandigital multiples (Java Solution) 
Project Euler > Problem 39 > Integer right triangles (Java Solution) 
Project Euler > Problem 40 > Champernowne's constant (Java Solution) 
Project Euler > Problem 41 > Pandigital prime (Java Solution) 
Project Euler > Problem 42 > Coded triangle numbers (Java Solution) 
Project Euler > Problem 43 > Sub-string divisibility (Java Solution) 
Project Euler > Problem 44 > Pentagon numbers (Java Solution) 
Project Euler > Problem 48 > Self powers (Java Solution) 
Project Euler > Problem 49 > Prime permutations (Java Solution) 
Project Euler > Problem 50 > Consecutive prime sum (Java Solution) 
Project Euler > Problem 51 > Prime digit replacements (Java Solution) 
Project Euler > Problem 52 > Permuted multiples (Java Solution) 
Project Euler > Problem 53 > Combinatoric selections (Java Solution) 
Project Euler > Problem 54 > Poker hands (Java Solution) 
Project Euler > Problem 55 > Lychrel numbers (Java Solution) 
Project Euler > Problem 56 > Powerful digit sum (Java Solution) 
Project Euler > Problem 57 > Square root convergents (Java Solution) 
Project Euler > Problem 58 > Spiral primes (Java Solution) 
Project Euler > Problem 59 > XOR decryption (Java Solution) 
Project Euler > Problem 60 > Prime pair sets (Java Solution) 
Project Euler > Problem 61 > Cyclical figurate numbers (Java Solution) 
Project Euler > Problem 62 > Cubic permutations (Java Solution) 
Project Euler > Problem 63 > Powerful digit counts (Java Solution) 
Project Euler > Problem 64 > Odd period square roots (Java Solution) 
Project Euler > Problem 65 > Convergents of e (Java Solution) 
Project Euler > Problem 66 > Diophantine equation (Java Solution) 
Project Euler > Problem 67 > Maximum path sum II (Java Solution) 
Project Euler > Problem 68 > Magic 5-gon ring (Java Solution) 
Project Euler > Problem 69 > Totient maximum (Java Solution) 
Project Euler > Problem 70 > Totient permutation (Java Solution) 
Project Euler > Problem 71 > Ordered fractions (Java Solution) 
Project Euler > Problem 72 > Counting fractions (Java Solution) 
Project Euler > Problem 73 > Counting fractions in a range (Java Solution) 
Project Euler > Problem 74 > Digit factorial chains (Java Solution) 
Project Euler > Problem 75 > Singular integer right triangles (Java Solution) 
Project Euler > Problem 76 > Counting summations (Java Solution) 
Project Euler > Problem 77 > Prime summations (Java Solution) 
Project Euler > Problem 78 > Coin partitions (Java Solution) 
Project Euler > Problem 79 > Passcode derivation (Java Solution) 
Project Euler > Problem 80 > Square root digital expansion (Java Solution) 
Project Euler > Problem 81 > Path sum: two ways (Java Solution) 
Project Euler > Problem 82 > Path sum: three ways (Java Solution) 
Project Euler > Problem 83 > Path sum: four ways (Java Solution) 
Project Euler > Problem 84 > Monopoly odds (Java Solution) 
Project Euler > Problem 85 > Counting rectangles (Java Solution) 
Project Euler > Problem 86 > Cuboid route (Java Solution) 
Project Euler > Problem 87 > Prime power triples (Java Solution) 
Project Euler > Problem 88 > Product-sum numbers (Java Solution) 
Project Euler > Problem 89 > Roman numerals (Java Solution) 
Project Euler > Problem 90 > Cube digit pairs (Java Solution) 
Project Euler > Problem 91 > Right triangles with integer coordinates (Java Solution) 
Project Euler > Problem 92 > Square digit chains (Java Solution) 
Project Euler > Problem 93 > Arithmetic expressions (Java Solution) 
Project Euler > Problem 94 > Almost equilateral triangles (Java Solution) 
Project Euler > Problem 95 > Amicable chains (Java Solution) 
Project Euler > Problem 96 > Su Doku (Java Solution) 
Project Euler > Problem 101 > Optimum polynomial (Java Solution) 
Project Euler > Problem 102 > Triangle containment (Java Solution) 
Project Euler > Problem 103 > Special subset sums: optimum (Java Solution) 
Project Euler > Problem 104 > Pandigital Fibonacci ends (Java Solution) 
Project Euler > Problem 105 > Special subset sums: testing (Java Solution) 
Project Euler > Problem 106 > Special subset sums: meta-testing (Java Solution) 
Project Euler > Problem 107 > Minimal network (Java Solution) 
Project Euler > Problem 108 > Diophantine reciprocals I (Java Solution) 
Project Euler > Problem 109 > Darts (Java Solution) 
Project Euler > Problem 110 > Diophantine reciprocals II (Java Solution) 
Project Euler > Problem 111 > Primes with runs (Java Solution) 
Project Euler > Problem 112 > Bouncy numbers (Java Solution) 
Project Euler > Problem 113 > Non-bouncy numbers (Java Solution) 
Project Euler > Problem 114 > Counting block combinations I (Java Solution) 
Project Euler > Problem 115 > Counting block combinations II (Java Solution) 
Project Euler > Problem 116 > Red, green or blue tiles (Java Solution) 
Project Euler > Problem 117 > Red, green, and blue tiles (Java Solution) 
Project Euler > Problem 118 > Pandigital prime sets (Java Solution) 
Project Euler > Problem 119 > Digit power sum (Java Solution) 
Project Euler > Problem 120 > Square remainders (Java Solution) 
Project Euler > Problem 121 > Disc game prize fund (Java Solution) 
Project Euler > Problem 122 > Efficient exponentiation (Java Solution) 
Project Euler > Problem 123 > Prime square remainders (Java Solution) 
Project Euler > Problem 124 > Ordered radicals (Java Solution) 
Project Euler > Problem 125 > Palindromic sums (Java Solution) 
Project Euler > Problem 126 > Cuboid layers (Java Solution) 
Project Euler > Problem 127 > abc-hits (Java Solution) 
Project Euler > Problem 128 > Hexagonal tile differences (Java Solution) 
Project Euler > Problem 129 > Repunit divisibility (Java Solution) 
Project Euler > Problem 130 > Composites with prime repunit property (Java Solution) 
Project Euler > Problem 131 > Prime cube partnership (Java Solution) 
Project Euler > Problem 132 > Large repunit factors (Java Solution) 
Project Euler > Problem 133 > Repunit nonfactors (Java Solution) 
Project Euler > Problem 134 > Prime pair connection (Java Solution) 
Project Euler > Problem 135 > Same differences (Java Solution) 
Project Euler > Problem 136 > Singleton difference (Java Solution) 
Project Euler > Problem 137 > Fibonacci golden nuggets (Java Solution) 
Project Euler > Problem 138 > Special isosceles triangles (Java Solution) 
Project Euler > Problem 139 > Pythagorean tiles (Java Solution) 
Project Euler > Problem 140 > Modified Fibonacci golden nuggets (Java Solution) 
Project Euler > Problem 141 > Investigating progressive numbers, n, which are also square. (Java Solution) 
Project Euler > Problem 142 > Perfect Square Collection (Java Solution) 
Project Euler > Problem 143 > Investigating the Torricelli point of a triangle (Java Solution) 
Project Euler > Problem 144 > Investigating multiple reflections of a laser beam. (Java Solution) 
Project Euler > Problem 145 > How many reversible numbers are there below one-billion? (Java Solution) 
Project Euler > Problem 146 > Investigating a Prime Pattern (Java Solution) 
Project Euler > Problem 147 > Rectangles in cross-hatched grids (Java Solution) 
Project Euler > Problem 148 > Exploring Pascal's triangle. (Java Solution) 
Project Euler > Problem 149 > Searching for a maximum-sum subsequence. (Java Solution) 
Project Euler > Problem 150 > Searching a triangular array for a sub-triangle having minimum-sum. (Java Solution) 
Pirate Bay (piratebay.sx) down, how to regain access to piratebay 
Project Euler > Problem 151 > Paper sheets of standard sizes: an expected-value problem. (Java Solution) 
Project Euler > Problem 152 > Writing 1/2 as a sum of inverse squares (Java Solution) 
Project Euler > Problem 153 > Investigating Gaussian Integers (Java Solution) 
Project Euler > Problem 154 > Exploring Pascal's pyramid. (Java Solution) 
Project Euler > Problem 155 > Counting Capacitor Circuits. (Java Solution) 
Project Euler > Problem 156 > Counting Digits (Java Solution) 
Project Euler > Problem 157 > Solving the diophantine equation 1/a+1/b= p/10n (Java Solution) 
Project Euler > Problem 158 > Exploring strings for which only one character comes lexicographically after its neighbour to the left. (Java Solution) 
Project Euler > Problem 159 > Digital root sums of factorisations. (Java Solution) 
Project Euler > Problem 160 > Factorial trailing digits (Java Solution) 
Project Euler > Problem 161 > Triominoes (Java Solution) 
Project Euler > Problem 162 > Hexadecimal numbers (Java Solution) 
Project Euler > Problem 163 > Cross-hatched triangles (Java Solution) 
Project Euler > Problem 164 > Numbers for which no three consecutive digits have a sum greater than a given value. (Java Solution) 
Project Euler > Problem 165 > Intersections (Java Solution) 
Project Euler > Problem 166 > Criss Cross (Java Solution) 
Project Euler > Problem 167 > Investigating Ulam sequences (Java Solution) 
Project Euler > Problem 168 > Number Rotations (Java Solution) 
Project Euler > Problem 169 > Exploring the number of different ways a number can be expressed as a sum of powers of 2. (Java Solution) 
Project Euler > Problem 170 > Find the largest 0 to 9 pandigital that can be formed by concatenating products. (Java Solution) 
Project Euler > Problem 171 > Finding numbers for which the sum of the squares of the digits is a square. (Java Solution) 
Project Euler > Problem 172 > Investigating numbers with few repeated digits. (Java Solution) 
Project Euler > Problem 173 > Using up to one million tiles how many different "hollow" square laminae can be formed? (Java Solution) 
Project Euler > Problem 174 > Counting the number of "hollow" square laminae that can form one, two, three, ... distinct arrangements. (Java Solution) 
Project Euler > Problem 175 > Fractions involving the number of different ways a number can be expressed as a sum of powers of 2. (Java Solution) 
Project Euler > Problem 176 > Right-angled triangles that share a cathetus. (Java Solution) 
Project Euler > Problem 177 > Integer angled Quadrilaterals. (Java Solution) 
Project Euler > Problem 178 > Step Numbers (Java Solution) 
Project Euler > Problem 179 > Consecutive positive divisors (Java Solution) 
Project Euler > Problem 180 > Rational zeros of a function of three variables. (Java Solution) 
Project Euler > Problem 181 > Investigating in how many ways objects of two different colours can be grouped. (Java Solution) 
Project Euler > Problem 182 > RSA encryption (Java Solution) 
Project Euler > Problem 183 > Maximum product of parts (Java Solution) 
Project Euler > Problem 184 > Triangles containing the origin. (Java Solution) 
Project Euler > Problem 185 > Number Mind (Java Solution) 
Project Euler > Problem 186 > Connectedness of a network. (Java Solution) 
Project Euler > Problem 187 > Semiprimes (Java Solution) 
Project Euler > Problem 188 > The hyperexponentiation of a number (Java Solution) 
Project Euler > Problem 189 > Tri-colouring a triangular grid (Java Solution) 
Project Euler > Problem 190 > Maximising a weighted product (Java Solution) 
Project Euler > Problem 191 > Prize Strings (Java Solution) 
Project Euler > Problem 192 > Best Approximations (Java Solution) 
Project Euler > Problem 193 > Squarefree Numbers (Java Solution) 
Project Euler > Problem 194 > Coloured Configurations (Java Solution) 
Project Euler > Problem 195 > Inscribed circles of triangles with one angle of 60 degrees (Java Solution) 

Follow Me

If you like our content, feel free to follow me to stay updated.

Subscribe

Enter your email address:

We hate spam as much as you do.

Upload Material

Got an exam, project, tutorial video, exercise, solutions, unsolved problem, question, solution manual? We are open to any coding material. Why not upload?

Upload

Copyright © 2012 - 2014 Java Problems  --  About  --  Attribution  --  Privacy Policy  --  Terms of Use  --  Contact