Descending primes: Difference between revisions
m
→{{header|Delphi}}
No edit summary |
|||
Line 421:
S:=S+Format('%12.0n', [I*1.0]);
Inc(Cnt);
if (Cnt mod
begin
Memo.Lines.Add(S);
Line 431:
Memo.Lines.Add('Descending Primes Found: '+IntToStr(Cnt));
end;
Line 437 ⟶ 436:
{{out}}
<pre>
2 3 5 7 31 41 43 53
87,643 94,321 96,431 97,651 98,321 98,543 98,621 98,641
98,731 764,321 865,321 876,431 975,421 986,543 987,541 987,631
8,764,321 8,765,321 9,754,321 9,875,321 97,654,321 98,764,321 98,765,431
Descending Primes Found: 87
</pre>
=={{header|F_Sharp|F#}}==
| |||