Jacobsthal numbers: Difference between revisions
→{{header|Delphi}}
No edit summary |
|||
Line 1,220:
{Calculate Nn = Nn-1 + 2 Nn-2}
for I:=2 to Max-1 do
IA[I]:=IA[I-1] + 2 * IA[I-2];
end;
Line 1,236:
end;
end;
procedure GetJacobsthalPrimes(Memo: TMemo);
var I: integer;
var Jacob,N1, N2: int64;
function GetNext: int64;
{Nn = Nn-1 + 2 x Nn-2}
begin
Result:=N1 + 2 * N2;
N2:=N1; N1:=Result;
end;
begin
N2:=0; N1:=1;
for I:=1 to 10 do
begin
repeat Jacob:=GetNext;
until IsPrime(Jacob);
Memo.Lines.Add(IntToStr(I)+' - '+IntToStr(Jacob));
end;
end;
Line 1,274 ⟶ 1,297:
end;
Memo.Lines.Add(S);
Memo.Lines.Add('');
GetJacobsthalPrimes(Memo);
end;
Line 1,309 ⟶ 1,335:
15,270,965,703 61,084,037,575
1 - 3
Elapsed Time: 14.536 ms.▼
2 - 5
3 - 11
4 - 43
5 - 683
6 - 2731
7 - 43691
8 - 174763
9 - 2796203
10 - 715827883
</pre>
=={{header|F Sharp|F#}}==
| |||