Composite numbers k with no single digit factors whose factors are all substrings of k: Difference between revisions

m
(add RPL)
Line 1,360:
≫ '<span style="color:blue">MATRIOSHKA?</span>' STO
{999999999 } max
≪ { }
<span style="color:red">11 </span>MAXR EVAL '''FOR''' j
'''IF''' <span style="color:red">{11 3 5 7 }</span> ≪ j SWAP MOD ≫ MAP ΠLISTmax '''THENFOR''' <span style="color:grey">@ if no single digit factor</span>j
'''IF''' j R→I <span style="color:bluered">MATRIOSHKA?105</span> GCD 1 == '''THEN''' <span style="color:grey">@ if no single digit factor</span>
'''IF''' DUP SIZEj <span style="color:redblue">6MATRIOSHKA?</span> == '''THEN''' MAXR EVAL 'j' STO '''END'''
j +
'''IF''' DUP SIZE <span style="color:red">6</span> == '''THEN''' MAXR EVAL 'j' STO '''END'''
'''IF''' DUP SIZE <span style="color:red">6</span> == '''THEN''' max 'j' STO '''END'''
'''END'''
'''END'''
<span style="color:red">2</span> '''STEPEND'''
<span style="color:red">11 2</span>MAXR EVAL '''FORSTEP''' j
≫ '<span style="color:blue">TASK</span>' STO
{{out}}
<pre>
1: {15317. 59177. 83731. 119911. 183347. 192413.}
</pre>
Finding the first 6six numbers takes 64 minutes 5220 seconds onwith aan iOS HP-49 emulator, meaning that more thanabout two hours would be required to get ten. We're gonna need a bigger boat.
 
 
=={{header|Ruby}}==
1,150

edits