Largest proper divisor of n: Difference between revisions
Content added Content deleted
(→{{header|Ruby}}: Add Ruby) |
(→{{header|Ruby}}: added prime check) |
||
| Line 1,412: | Line 1,412: | ||
</pre> |
</pre> |
||
=={{header|Ruby}}== |
=={{header|Ruby}}== |
||
<lang ruby> |
<lang ruby>require 'prime' |
||
def a(n) |
|||
return 1 if n == 1 |
return 1 if n == 1 || n.prime? |
||
(n/2).downto(1).detect{|d| n.remainder(d) == 0} |
(n/2).downto(1).detect{|d| n.remainder(d) == 0} |
||
end |
end |
||