Daniel Gaytán daniel-g
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
| Influent.find(349).outcomes(1) | |
| => "{ \"outcome\" : { \"rank\" : 1, \"satisfaction\" : 1, \"options\" : [ { \"id\" : \"214\" }, { \"id\" : \"216\" }, { \"id\" : \"223\" }, { \"id\" : \"225\" }, { \"id\" : \"226\" }, { \"id\" : \"227\" } ] } }" | |
| Influent.find(349).outcomes(1) | |
| => "{ \"outcome\" : { \"rank\" : 1, \"satisfaction\" : 1, \"options\" : [ { \"id\" : \"223\" } ] } }" |
daniel-g
/ euler-problem-12.rb
Created
January 7, 2014 18:37
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
| require 'prime' | |
| def divisors_count(n) | |
| Prime.prime_division(n).reduce(1) do |mem, prime_factor| | |
| mem * (prime_factor[1] + 1) | |
| end | |
| end | |
| def triangle_number(n) | |
| (n)*(n+1)/2 |
OlderNewer