Find numbers n in base 2 where n is prime and all it's digits are 1: Difference between revisions
Find numbers n in base 2 where n is prime and all it's digits are 1 (view source)
Revision as of 01:30, 9 March 2021
, 3 years agono edit summary
(Created page with "{{Draft task}} ;Task: Find numbers n in base 2 where n is prime and all it's digits are 1 Let 1 < n < 10000 =={{header|Ring}}== <lang ring> load "stdlib.ring" num = 0 limit...") |
No edit summary |
||
Line 3:
;Task:
Find numbers n in base 2 where n is prime and all it's digits are 1
<br>Let 1 < n < 10000
=={{header|Ring}}==
| |||