Numbers in base 10 that are palindromic in bases 2, 4, and 16: Difference between revisions
Content added Content deleted
Not a robot (talk | contribs) (Add BCPL) |
m (→{{header|REXX}}: changed wording in the REXX section header.) |
||
Line 202: | Line 202: | ||
<br>function) because they are much faster). |
<br>function) because they are much faster). |
||
This REXX version takes advantage that no even integers need be tested (except for the single exception: zero), |
This REXX version takes advantage that no ''even'' integers need be tested (except for the single exception: zero), |
||
<br>this makes the execution twice as fast. |
<br>this makes the execution twice as fast. |
||
<lang rexx>/*REXX pgm finds non─neg integers that are palindromes in base 2, 4, and 16, where N<25k*/ |
<lang rexx>/*REXX pgm finds non─neg integers that are palindromes in base 2, 4, and 16, where N<25k*/ |