python.p0001 Namespace Reference

Functions
def	summation
def	main ()

Detailed Description

Project Euler Question 1

I decided I wanted to take a functional approach on this one. It also uses only
lazy functions, so it should take minimal memory usage.

Revision 1:

I found a closed form solution that works in the general case, so it's about an
order of magnitude faster now. It no longer uses lazy functions

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.

Function Documentation

def python.p0001.main

(

int

)

Here is the call graph for this function:

def python.p0001.summation

(

up_to

)

Here is the caller graph for this function: