Summarize primes: Difference between revisions

=={{header|Delphi}}==

{{works with|Delphi|6.0}}

{{libheader|SysUtils,StdCtrls}}

Uses the [[Extensible_prime_generator#Delphi|Delphi Prime-Generator Object]]

<syntaxhighlight lang="Delphi">

procedure SumOfPrimeSequences(Memo: TMemo);

var Sieve: TPrimeSieve;

var I,Inx, Sum: integer;

begin

Sieve:=TPrimeSieve.Create;

try

Sieve.Intialize(100000);

Memo.Lines.Add(' I P(I) Sum');

Memo.Lines.Add('---------------');

I:=0;

Sum:=0;

while Sieve.Primes[I]<1000 do

begin

Sum:=Sum+Sieve.Primes[I];

if Sieve.Flags[Sum] then

begin

Memo.Lines.Add(Format('%3d %4d %6d',[I,Sieve.Primes[I],Sum]));

end;

Inc(I,1);

end;

finally Sieve.Free; end;

end;

</syntaxhighlight>

{{out}}

<pre>

I P(I) Sum

---------------

0 2 2

1 3 5

3 7 17

5 13 41

11 37 197

13 43 281

59 281 7699

63 311 8893

95 503 22039

99 541 24133

101 557 25237

107 593 28697

113 619 32353

121 673 37561

123 683 38921

129 733 43201

131 743 44683

145 839 55837

151 881 61027

157 929 66463

161 953 70241

Elapsed Time: 31.759 ms.

</pre>