Created
June 27, 2011 16:04
-
-
Save diegodfsd/1049158 to your computer and use it in GitHub Desktop.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #Primeiro problema do Project Euler http://projecteuler.net/ | |
| #”Se nós listarmos todos os números naturais abaixo de 10, que são multiplos de 3 ou 5, nós obtemos 3,5,6 e 9. | |
| #A soma destes múltiplos é 23. Encontre a soma de todos os múltiplos de 3 ou 5 abaixo de 1000.” | |
| (1..1000).find_all{ |n| (n % 3).zero? || (n % 5).zero? }.inject{|sum,n| sum + n} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment