ProjectEuler.kt

This repository contains the solution for some of the problems listed in the ProjectEuler.net.

What is Project Euler?

Project Euler is a series of challenging mathematical/computer programming problems that will require more than just mathematical insights to solve. Although mathematics will help you arrive at elegant and efficient methods, the use of a computer and programming skills will be required to solve most problems.

The motivation for starting Project Euler, and its continuation, is to provide a platform for the inquiring mind to delve into unfamiliar areas and learn new concepts in a fun and recreational context.

The solutions to the problems try to be idiomatic Kotlin and some of them have alternative solutions written. Feel free to raise an issue for any comment or advice you have, it will be highly appreciate it.

Solutions

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 power
31. Coin sums
32. Pandigital products
33. Digit cancelling fractions
34. Digit factorials
35. Circular primes
36. Double-base palindromes
37. Truncatable primes