Amicable pairs: Difference between revisions
m
→{{header|ALGOL-60}}
No edit summary |
|||
Line 303:
<lang algol60>
begin
comment - return p mod q;
integer procedure mod(p, q);
Line 310 ⟶ 311:
end;
comment - return
integer procedure sumf(n);
value n; integer n;
Line 332 ⟶ 333:
comment - main program begins here;
integer a, b, c;
outstring(1,"Searching up to
for a := 2 step 1 until
begin
b := sumf(a);
Line 354 ⟶ 355:
<pre>
Searching up to 20000 for amicable pairs
220 284
1184 1210
2620 2924
5020 5564
6232 6368
10744 10856
12285 14595
17296 18416
That's all. Goodbye.
|