Largest proper divisor of n: Difference between revisions

→‎{{header|Ruby}}: added prime check
(→‎{{header|Ruby}}: added prime check)
Line 1,412:
</pre>
=={{header|Ruby}}==
<lang ruby>defrequire a(n)'prime'
def a(n)
return 1 if n == 1 || n.prime?
(n/2).downto(1).detect{|d| n.remainder(d) == 0}
end
1,149

edits