Iccanobif primes: Difference between revisions
m
→{{header|J}}: discard f3 as unnecessary, and include some comments
m (→{{header|J}}: stretch) |
m (→{{header|J}}: discard f3 as unnecessary, and include some comments) |
||
Line 414:
=={{header|J}}==
Implementation:
<syntaxhighlight lang=J>
2 3 5 13 89 233 1597 28657 514229 433494437 2971215073
In other words, 70 numbers from the fibonacci sequence, reverse their digits, and keep those which are prime.
Stretch:
Line 424 ⟶ 426:
<syntaxhighlight lang="J"> #@":@> 10}. (#~ 1&p:)|.&.(10&#.inv)"0 (, _2 +/@{. ])^:20000]1x
14 21 37 40 80 104 137 330 406 409 503 888 1020 1122 1911 1947 2283 3727</syntaxhighlight>
For the stretch goal we use extended precision integers instead of the usual fixed width representation, reverse the digits numerically rather than relying on the character representation of the numbers (though it's simplest to rely on the character representation for counting the digits of the resulting primes).
=={{header|jq}}==
| |||