roddy | Entries tagged with plt scheme

When I get depressed, I program. I recently found myself in a severe funk, so I started looking around for some interesting programming projects to do.

Enter Project Euler. (For the uninitiated or uninformed, that's pronounced "Oiler", not "Yew-ler.") Project Euler contains a series of over 300 mathematical and logical problems of various difficulties. The idea is, with all these programming languages available, a solution should be possible.

I decided, for the sake of being different, that I'd do my Project Euler problems in PLT Scheme.

Add all the natural numbers below one thousand that are multiples of 3 or 5. (19 November 2010)

This is the first in a series of posts about attempting Project Euler in PLT Scheme. The posting schedule is, for the most part, every Friday. For more information, see the introductory post.

The first problem on Project Euler is relatively simple:

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.

— Project Euler

( See solution. )