Largest proper divisor of n: Difference between revisions
Content added Content deleted
(add fermat) |
Not a robot (talk | contribs) (Add Draco) |
||
| Line 638: | Line 638: | ||
i := i + 1; |
i := i + 1; |
||
end loop;</lang> |
end loop;</lang> |
||
{{out}} |
|||
<pre> 1 1 1 2 1 3 1 4 3 5 |
|||
1 6 1 7 5 8 1 9 1 10 |
|||
7 11 1 12 5 13 9 14 1 15 |
|||
1 16 11 17 7 18 1 19 13 20 |
|||
1 21 1 22 15 23 1 24 7 25 |
|||
17 26 1 27 11 28 19 29 1 30 |
|||
1 31 21 32 13 33 1 34 23 35 |
|||
1 36 1 37 25 38 11 39 1 40 |
|||
27 41 1 42 17 43 29 44 1 45 |
|||
13 46 31 47 19 48 1 49 33 50</pre> |
|||
=={{header|Draco}}== |
|||
<lang draco>proc nonrec lpd(word n) word: |
|||
word d; |
|||
if n=1 then |
|||
1 |
|||
else |
|||
d := n-1; |
|||
while n % d /= 0 do d := d-1 od; |
|||
d |
|||
fi |
|||
corp |
|||
proc nonrec main() void: |
|||
word n; |
|||
for n from 1 upto 100 do |
|||
write(lpd(n):3); |
|||
if n%10 = 0 then writeln() fi |
|||
od |
|||
corp</lang> |
|||
{{out}} |
{{out}} |
||
<pre> 1 1 1 2 1 3 1 4 3 5 |
<pre> 1 1 1 2 1 3 1 4 3 5 |
||
| Line 661: | Line 692: | ||
Real: 00:00:00.015 |
Real: 00:00:00.015 |
||
</pre> |
</pre> |
||
=={{header|Factor}}== |
=={{header|Factor}}== |
||
{{works with|Factor|0.99 2021-02-05}} |
{{works with|Factor|0.99 2021-02-05}} |
||