Smallest number k such that k+2^m is composite for all m less than k: Difference between revisions
Smallest number k such that k+2^m is composite for all m less than k (view source)
Revision as of 14:23, 31 March 2024
, 2 months agoadded RPL
(Added FreeBASIC) |
(added RPL) |
||
Line 261:
{{out}}
<pre>773 2131 2491 4471 5101</pre>
=={{header|RPL}}==
Long integers cannot be greater than 10<sup>500</sup> in PRL.
{{works with|HP49-C}}
« { } 3
'''WHILE''' DUP 1658 < '''REPEAT''' <span style="color:grey">''@ 2^1658 > 10^500''</span>
1 SF 1 OVER 1 -
'''FOR''' m
'''IF''' DUP 2 m ^ + ISPRIME? '''THEN''' 1 CF DUP 'm' STO '''END'''
'''NEXT'''
'''IF''' 1 FS? '''THEN''' SWAP OVER + SWAP '''END'''
2 +
'''END''' DROP
» '<span style="color:blue">TASK</span>' STO
{{out}}
<pre>
1: { 773 }
</pre>
=={{header|Ruby}}==
| |||