Primes whose sum of digits is 25: Difference between revisions
Added Delphi example
m (→Stretch goal) |
MaiconSoft (talk | contribs) (Added Delphi example) |
||
Line 54:
Found 17 sum25 primes below 5000
</pre>
=={{header|Delphi}}==
{{libheader| System.SysUtils}}
{{libheader| PrimTrial}}
{{Trans|Ring}}
<lang Delphi>
program Primes_which_sum_of_digits_is_25;
{$APPTYPE CONSOLE}
uses
System.SysUtils,
PrimTrial;
var
row: Integer = 0;
limit1: Integer = 25;
limit2: Integer = 5000;
function Sum25(n: Integer): boolean;
var
sum: Integer;
str: string;
c: char;
begin
sum := 0;
str := n.ToString;
for c in str do
inc(sum, strToInt(c));
Result := sum = limit1;
end;
begin
for var n := 1 to limit2-1 do
begin
if isPrime(n) and sum25(n) then
begin
inc(row);
write(n: 4, ' ');
if (row mod 5) = 0 then
writeln;
end;
end;
readln;
end.</lang>
{{out}}
<pre> 997 1699 1789 1879 1987
2689 2797 2887 3499 3697
3769 3877 3967 4597 4759
4957 4993</pre>
=={{header|Phix}}==
| |||