Project Eular #4 #5 #6 (Python)
Yet another three easy problems. #4 Find the largest palindrome made from the product of two 3-digit numbers. A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99. Find the largest palindrome made from the product of two 3-digit numbers. [...]
Project Eular #3 (Python)
Find the largest prime factor of a composite number. The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143 ? #!/usr/bin/env python num = 600851475143 seg_size = 10000 base_factor = 0 prime_factors = [] while base_factor*seg_size < num: for tmp in range(seg_size*base_factor, seg_size*(base_factor+1)): if [...]
Project Eular #2 (Python)
Project Eular #2 Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, … Find the sum of all the even-valued terms in the sequence which do not [...]
Project Eular #1(Python)
Project Eular #1 If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23. Find the sum of all the multiples of 3 or 5 below 1000. #!/usr/bin/env python sum = 0 for num in range(3,1000,3): [...]