## Snippets tagged euler problem

• ### Project Euler #2

Solution to Project Euler problem 2: Find sum of even terms in fibonacci sequence which do not exceed four million. Comments about the first version: 1. It does't use memoize becouse of recursive call to unmemoized function "fibs". So it take over 20 sec to get answer. A minor change ("fibs" to "fibs' ") reduces this time to 140ms.

35 people like this

Posted: 12 years ago by D

• ### Primitive Pythagorean triples

Primitive Pythagorean triples generator. It uses an Algorithm found on Wolfram MathWorld and the F# PowerPack matrix library.

46 people like this

Posted: 12 years ago by Cesar Mendoza

• ### Project Euler #1

This snippet is code that solves first Project Euler problem. It finds the sum of all the multiples of 3 or 5 below 1000. Please add other (more efficient, succinct or interesting) solutions to this snippet.

3 people like this

Posted: 3 years ago by Eugene Gavrin

• ### Project Euler #182

The RSA encryption is based on the following procedure: Generate two distinct primes p and q. Compute n=pq and phi=(p-1)(q-1). Find an integer e, 1 25 people like this

Posted: 12 years ago by Natallie Baikevich

• ### Euler #5

Euler #5 solution

3 people like this

Posted: 11 years ago by Michael Falanga