This series will be about the tasks from the Euler Project, which is a a project page for mathematical riddles with increasing difficulty.

After signing up, you can upload your solutions in order to get credits. At the moment there are 725 riddles at 29 levels (25 riddles per level). As you can see, the first task has been solved by almost a Million people (the last one not even by 500...).

The Euler Community permits sharing the results for task 1-100.

All of the tasks can be solved on a normal PC within a few minutes if the algorithm is implemented correctly. Many of the tasks have a little twist, meaning that they could be implemented in a straightforward way, but also in a more interesting, "smart" way.

The roots of functional programming lie in the algorithmic computation of mathematical problems, so it's not surprising that PicoLisp often enables us to write extremely concise and short code in order to solve these tasks. Similarly to the Rosetta code series, the main purpose of this series is to get more familiar with PicoLisp and its syntax and concepts.

When we find some interesting functions, we will pick them up for deeper discussion in the "PicoLisp Explored" Series.

Well, that's the plan!

If you want to prepare, here is the task for tomorrow:

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.

Sources

https://projecteuler.net
https://imgs.xkcd.com/comics/mathematical_symbol_fight.png

About the Euler Project

Comments (1)

The Euler Project in PicoLisp

Riddle 10: Summation of primes

More from this blog

A Railroad Simulation with DES

PicoLisp Explored: Discrete Event Simulation

PicoLixp Explored: On Coroutines

Data Visualization with D3.js and PicoLisp

Improving User Experience with Server-Sent Events

Sources

Command Palette

Comments (1)

The Euler Project in PicoLisp

Riddle 10: Summation of primes

More from this blog

Sources