Skip to content

Instantly share code, notes, and snippets.

View sleepynate's full-sized avatar

Nathan Dotz sleepynate

View GitHub Profile
{-
- Project Euler Problem 2
- Solution by nathan dotz - nathan (period) dotz (at sign) gmail (period) com
-
- Each new term in the Fibonacci sequence is generated by adding
- the previous two terms. By starting with 1 and 2, the first
- 10 terms will be:
- 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
-
- Find the sum of all the even-valued terms in the sequence
map <A-1> 1gt
map <A-2> 2gt
map <A-3> 3gt
map <A-4> 4gt
map <A-5> 5gt
map <A-6> 6gt
map <A-7> 7gt
map <A-8> 8gt
map <A-9> 9gt
map <A-0> 10gt
; Project Euler Problem 1
;
; 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.
;
; solution by nathan dotz
; nathan (period) dotz (at sign) gmail (period) com
{-
- Project Euler Problem 1
-
- 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.
-
- solution by nathan dotz
- nathan (period) dotz (at sign) gmail (period) com