Sum of primes in odd positions is prime: Difference between revisions
Content deleted Content added
No edit summary |
No edit summary |
||
| Line 3: | Line 3: | ||
;Task: |
;Task: |
||
<br>Let '''p(n)''' be a sequence of prime numbers. |
<br>Let '''p(n)''' be a sequence of prime numbers. |
||
<br>Consider the '''p(1),p(3),p(5), ... ,p(i)''' for each '''p(i) <= n''' |
<br>Consider the '''p(1),p(3),p(5), ... ,p(i)''' for each '''n < 1,000''' and '''p(i) <= n''' |
||
<br>Let '''sum''' be summarize of these primes. |
<br>Let '''sum''' be summarize of these primes. |
||
<br>If '''sum''' is prime then print '''p(i)''' and '''sum |
<br>If '''sum''' is prime then print '''p(i)''' and '''sum''' |
||
<br><br> |
<br><br> |
||