Anonymous user
Talk:Rare numbers: Difference between revisions
→the 2nd REXX version: added a 2nd REXX version and how it was used to optimize the 3rd REXX version.
(→the 2nd REXX version: added the 2nd REXX version.) |
(→the 2nd REXX version: added a 2nd REXX version and how it was used to optimize the 3rd REXX version.) |
||
Line 165:
end
end /*while q>1*/; return $</lang>
Still pretty sluggish, like molasses in March.
The above REXX program was modified to generate a group of numbers which were '''AB''' (two digit) numbers
<br>concatenated with '''PQ''' (two digit) numbers to yield a list of four digit numbers.
'''AB''' are the 1<sup>st</sup> two digits of a ''rare'' number, and '''PQ''' are the last two digits.
<br>This list was sorted and the duplicates removed, and it formed a list of (left 2 digits abutted with the right 2 digits)
<br>numbers that every ''rare'' number must have (except for the first ''rare'' number ('''65'''), which is found the ''hard''
<br>(slow) way.
| |||