Perfect totient numbers: Difference between revisions
Added Quackery.
MaiconSoft (talk | contribs) m (Added Delphi reference to Pascal code) |
(Added Quackery.) |
||
Line 1,205:
{{Out}}
<pre>[3, 9, 15, 27, 39, 81, 111, 183, 243, 255, 327, 363, 471, 729, 2187, 2199, 3063, 4359, 4375, 5571]</pre>
=={{header|Quackery}}==
<code>totient</code> is defined at [[Totient function#Quackery]].
<lang Quackery> [ 0 over
[ dup 1 != while
totient
dup dip +
again ]
drop = ] is perfecttotient ( n --> b )
[ [] 1
[ dup perfecttotient if
[ dup dip join ]
2 +
over size 20 =
until ] drop ] is task ( --> )
</lang>
{{out}}
<pre>[ 3 9 15 27 39 81 111 183 243 255 327 363 471 729 2187 2199 3063 4359 4375 5571 ]</pre>
=={{header|Racket}}==
| |||