{{ message }}

Instantly share code, notes, and snippets.

# Kirill Klenovklen

Created Mar 14, 2014
View test.py
 #!/usr/bin/env python import doctest import itertools as it import math def divisor_generator(num): """
Created Mar 26, 2014
View euler5.py
 """ Project Euler problem #5. """ from fractions import gcd def problem(): """ Solve the problem. 2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.
Created Mar 26, 2014
View euler6.py
 """ Project Euler problem #6. """ def problem(): """ Solve the problem. Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum. Answer: 25164150
Created Mar 26, 2014
View euler2.py
 """ Project Euler problem #2. """ def problem(): """ Solve the problem. By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms. Answer: 4613732
Last active Aug 29, 2015
View euler3.py
 """ Project Euler problem #3. """ def problem(): """ Solve the problem. What is the largest prime factor of the number 600851475143 ? Answer: 6857
Last active Aug 29, 2015
View problem1.py
 """ Project Euler problem #1. """ def problem(): """ Solve the problem. 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.
Created Mar 26, 2014
View euler4.py
 """ Project Euler problem #4. """ import itertools as it def problem(): u""" Solve the problem. A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 * 99.
Created Apr 7, 2014
View horneds@gmail.com.pub