Largest proper divisor of n: Difference between revisions

m
Line 338:
 
=={{header|Julia}}==
<lang julia>largestpd(n) = (for i in n-1n÷2:-1:1 (n % i == 0) && return i; end; 1)
 
foreach(n -> print(rpad(largestpd(n), 3), n % 10 == 0 ? "\n" : ""), 1:100)
4,111

edits