This website is a semi-functional mirror of the original Project Euler. More information is available on GitHub.

Problems


ID Description / Title
101
 Optimum polynomial
102
 Triangle containment
103
 Special subset sums: optimum
104
 Pandigital Fibonacci ends
105
 Special subset sums: testing
106
 Special subset sums: meta-testing
107
 Minimal network
108
 Diophantine reciprocals I
109
 Darts
110
 Diophantine reciprocals II
111
 Primes with runs
112
 Bouncy numbers
113
 Non-bouncy numbers
114
 Counting block combinations I
115
 Counting block combinations II
116
 Red, green or blue tiles
117
 Red, green, and blue tiles
118
 Pandigital prime sets
119
 Digit power sum
120
 Square remainders
121
 Disc game prize fund
122
 Efficient exponentiation
123
 Prime square remainders
124
 Ordered radicals
125
 Palindromic sums
126
 Cuboid layers
127
 abc-hits
128
 Hexagonal tile differences
129
 Repunit divisibility
130
 Composites with prime repunit property
131
 Prime cube partnership
132
 Large repunit factors
133
 Repunit nonfactors
134
 Prime pair connection
135
 Same differences
136
 Singleton difference
137
 Fibonacci golden nuggets
138
 Special isosceles triangles
139
 Pythagorean tiles
140
 Modified Fibonacci golden nuggets
141
 Investigating progressive numbers, n, which are also square
142
 Perfect Square Collection
143
 Investigating the Torricelli point of a triangle
144
 Investigating multiple reflections of a laser beam
145
 How many reversible numbers are there below one-billion?
146
 Investigating a Prime Pattern
147
 Rectangles in cross-hatched grids
148
 Exploring Pascal's triangle
149
 Searching for a maximum-sum subsequence
150
 Searching a triangular array for a sub-triangle having minimum-sum