Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/melwyn95/projecteuler-problems
My solutions to project euler problems
https://github.com/melwyn95/projecteuler-problems
project-euler
Last synced: about 1 month ago
JSON representation
My solutions to project euler problems
- Host: GitHub
- URL: https://github.com/melwyn95/projecteuler-problems
- Owner: melwyn95
- Created: 2016-11-25T17:27:53.000Z (about 8 years ago)
- Default Branch: master
- Last Pushed: 2020-02-17T11:09:25.000Z (almost 5 years ago)
- Last Synced: 2024-10-22T02:22:56.497Z (3 months ago)
- Topics: project-euler
- Language: Python
- Homepage:
- Size: 85.9 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# ProjectEuler-Problems
1. Longest Collatz Sequence
2. Largest Prime Factor
3. Prime Summations
4. XORDecryption
5. Multiples of 3 and 5
6. Special Pythagorean triplet
7. Summation Of Primes (Used Seive of Eratosthenes)
8. Digit Factorial Chain (Finally Long wait over Solved it memoization DP)(Planning to rewrite it in Java)
9. Maximum Path Sum 1 (Took Help From Discussion)(Very Important and Interesting Problem uses concept of BFS)
10. Highly divisible triangular number (Trick to this problem was to find the number of factors a number has we have to multiply the powers of its prime factors + 1 e.g. (p+1)(q+1)(r+1))
11. Pandigital Prime (Generated permuations of digits!!!! :))
12. Largest product in a grid
13. Coded triangle numbers
14. Pentagon Numbers (use property of pentagonal numbers i.e. n=(sqrt(1+24*x)+1)/6 is natural number)
15. Truncatable primes (very un-optimized NEED TO OPTIMIZE SOLUTION)
16. Non-abundant sums
17. N-Digit Fibonacci Number
18. Goldbach's other conjecture
19. Amicable Numbers
20. Prime power triples
21. Circular Primes
22. Quadratic Primes
23. Lexicographic Permutations
24. Lattice Paths