Sum of primes in odd positions is prime: Difference between revisions
Content added Content deleted
No edit summary |
|||
| Line 266: | Line 266: | ||
{{works with|Delphi|6.0}} |
{{works with|Delphi|6.0}} |
||
{{libheader|SysUtils,StdCtrls}} |
{{libheader|SysUtils,StdCtrls}} |
||
Straight forward implementation of the problem |
|||
Uses the [[Extensible_prime_generator#Delphi|Delphi Prime-Generator Object]] |
|||
<syntaxhighlight lang="Delphi"> |
<syntaxhighlight lang="Delphi"> |
||
| Line 314: | Line 315: | ||
</pre> |
</pre> |
||
=={{header|F_Sharp|F#}}== |
=={{header|F_Sharp|F#}}== |
||