My solutions for tasks from Project Euler:
- Problem 1. Multiples of 3 and 5
- Problem 2. Even Fibonacci numbers
- Problem 3. Largest prime factor
- Problem 4. Largest palindrome product
- Problem 5. Smallest multiple - solved by hand
- Problem 6. Sum square difference
- Problem 7. 10001st prime
- Problem 8. Largest product in a series
- Problem 9. Special Pythagorean triplet
- Problem 10. Summation of primes
- Problem 11. Largest product in a grid
- Problem 12. Highly divisible triangular number
- Problem 13. Large sum
- Problem 14. Longest Collatz sequence
- Problem 15. Lattice paths
- Problem 16. Power digit sum
- Problem 17. Number letter counts
- Problem 18. Maximum path sum I
- Problem 19. Counting Sundays
- Problem 20. Factorial digit sum
- Problem 21. Amicable numbers
- Problem 22. Names scores
- Problem 23. Non-abundant sums
- Problem 24. Lexicographic permutations
- Problem 25. 1000-digit Fibonacci number
- Problem 26. Reciprocal cycles
- Problem 27. Quadratic primes
- Problem 28. Number spiral diagonals
- Problem 29. Distinct powers
- Problem 30. Digit fifth powers
- Problem 31. Coin sums
- Problem 32. Pandigital products
- Problem 33. Digit cancelling fractions
- Problem 34. Digit factorials
- Problem 35. Circular primes
- Problem 36. Double-base palindromes
- Problem 37. Truncatable primes
- Problem 38. Pandigital multiples
- Problem 39. Integer right triangles
- Problem 40. Champernowne's constant
- Problem 41. Pandigital prime
- Problem 42. Coded triangle numbers
- Problem 43. Sub-string divisibility
- Problem 44. Pentagon numbers
- Problem 45. Triangular, pentagonal, and hexagonal
- Problem 46. Goldbach's other conjecture
- Problem 47. Distinct primes factors
- Problem 48. Self powers
- Problem 49. Prime permutations
- Problem 50. Consecutive prime sum
- Problem 51. Prime digit replacements
- Problem 52. Permuted multiples
- Problem 53. Combinatoric selections
- Problem 54. Poker hands
- Problem 55. Lychrel numbers
- Problem 56. Powerful digit sum
- Problem 57. Square root convergents
- Problem 58. Spiral primes
- Problem 59. XOR decryption
- Problem 60. Prime pair sets
- Problem 61. Cyclical figurate numbers
- Problem 62. Cubic permutations
- Problem 63. Powerful digit counts - solved by hand
- Problem 64. Odd period square roots
- Problem 65. Convergents of e
- Problem 66. Diophantine equation
- Problem 67. Maximum path sum II
- Problem 68. Magic 5-gon ring
- Problem 69. Totient maximum
- Problem 70. Totient permutation
- Problem 71. Ordered fractions
- Problem 72. Counting fractions
- Problem 73. Counting fractions in a range
- Problem 74. Digit factorial chains
- Problem 75. Singular integer right triangles
- Problem 76. Counting summations
- Problem 77. Prime summations
- Problem 78. Coin partitions
- Problem 79. Passcode derivation - solved by hand
- Problem 80. Square root digital expansion
- Problem 81. Path sum: two ways
- Problem 82. Path sum: three ways
- Problem 83. Path sum: four ways
- Problem 84. Monopoly odds
- Problem 85. Counting rectangles
- Problem 86. Cuboid route
- Problem 87. Prime power triples
- Problem 88. Product-sum numbers
- Problem 89. Roman numerals
- Problem 90. Cube digit pairs
- Problem 91. Right triangles with integer coordinates
- Problem 92. Square digit chains
- Problem 93. Arithmetic expressions
- Problem 94. Almost equilateral triangles
- Problem 95. Amicable chains
- Problem 96. Su Doku
- Problem 97. Large non-Mersenne prime
- Problem 98. Anagramic squares
- Problem 99. Largest exponential
- Problem 100. Arranged probability
- Problem 101. Optimum polynomial
- Problem 102. Triangle containment
- Problem 103. Special subset sums: optimum
- Problem 104. Pandigital Fibonacci ends
- Problem 105. Special subset sums: testing
- Problem 106. Special subset sums: meta-testing
- Problem 107. Minimal network
- Problem 109. Darts
- Problem 111. Primes with runs
- Problem 112. Bouncy numbers
- Problem 113. Non-bouncy numbers
- Problem 114. Counting block combinations I
- Problem 115. Counting block combinations II
- Problem 116. Red, green or blue tiles
- Problem 117. Red, green and blue tiles
- Problem 118. Pandigital prime sets
- Problem 119. Digit power sum
- Problem 120. Square remainders
- Problem 122. Efficient exponentiation
- Problem 123. Prime square remainders
- Problem 124. Ordered radicals
- Problem 125. Palindromic sums
- Problem 127. abc-hits
- Problem 128. Hexagonal tile differences
- Problem 131. Prime cube partnership
- Problem 135. Same Differences
- Problem 136. Singleton Difference
- Problem 144. Investigating multiple reflections of a laser beam
- Problem 145. How many reversible numbers are there below one-billion?
- Problem 148. Exploring Pascal's triangle
- Problem 155. Counting Capacitor Circuits
- Problem 158. Exploring strings for which only one character comes lexicographically after its neighbour to the left
- Problem 162. Hexadecimal numbers
- Problem 164. Numbers for which no three consecutive digits have a sum greater than a given value
- Problem 172. Investigating numbers with few repeated digits
- Problem 173. Using up to one million tiles how many different "hollow" square laminae can be formed?
- Problem 174. Counting the number of "hollow" square laminae that can form one, two, three, ... distinct arrangements
- Problem 178. Step Numbers
- Problem 179. Consecutive positive divisors
- Problem 183. Maximum product of parts
- Problem 187. Semiprimes
- Problem 190. Maximising a weighted product
- Problem 191. Prize Strings
- Problem 203. Squarefree Binomial Coefficients
- Problem 204. Generalised Hamming Numbers
- Problem 205. Dice Game
- Problem 206. Concealed Square
- Problem 207. Integer partition equations
- Problem 214. Totient Chains
- Problem 215. Crack-free Walls
- Problem 265. Binary Circles
- Problem 301. Nim
- Problem 310. Nim Square
- Problem 315. Digital root clocks
- Problem 317. Firecracker
- Problem 336. Maximix Arrangements
- Problem 345. Matrix Sum
- Problem 346. Strong Repunits
- Problem 347. Largest integer divisible by two primes
- Problem 357. Prime generating integers
- Problem 493. Under The Rainbow
- Problem 587. Concave triangle
- Problem 684. Inverse Digit Sum
- Problem 686. Powers of Two
- Problem 700. Eulercoin
- Problem 800. Hybrid Integers