Numbers in base 10 that are palindromic in bases 2, 4, and 16: Difference between revisions

m
→‎{{header|Uiua}}: Slight improvement
(→‎Much faster approach: cleaned the code)
m (→‎{{header|Uiua}}: Slight improvement)
 
(4 intermediate revisions by 3 users not shown)
Line 523:
</pre>
 
 
=={{header|EasyLang}}==
<syntaxhighlight>
func rev n base .
while n > 0
r = r * base + n mod base
n = n div base
.
return r
.
for i = 0 to 25000 - 1
if rev i 2 = i and rev i 4 = i and rev i 16 = i
write i & " "
.
.
</syntaxhighlight>
{{out}}
<pre>
0 1 3 5 15 17 51 85 255 257 273 771 819 1285 1365 3855 4095 4097 4369 12291 13107 20485 21845
</pre>
 
=={{header|Euler}}==
Line 1,219 ⟶ 1,239:
<pre>
[0, 1, 3, 5, 15, 17, 51, 85, 255, 257, 273, 771, 819, 1285, 1365, 3855, 4095, 4097, 4369, 12291, 13107, 20485, 21845]
</pre>
 
=={{header|Uiua}}==
<syntaxhighlight lang="ecmascriptuiua">import "/fmt" for Conv, Fmt
▽⊸≡(/↧≡(≍⇌.⬚0↯⊟∞)[4 2 1]¤⋯)⇡25000
</syntaxhighlight>
{{out}}
<pre>
[0 1 3 5 15 17 51 85 255 257 273 771 819 1285 1365 3855 4095 4097 4369 12291 13107 20485 21845]
</pre>
 
=={{header|Wren}}==
{{libheader|Wren-fmt}}
<syntaxhighlight lang="wren">import "./fmt" for Conv, Fmt
{{libheader|Wren-seq}}
<syntaxhighlight lang="ecmascript">import "/fmt" for Conv, Fmt
import "/seq" for Lst
 
System.print("Numbers under 25,000 in base 10 which are palindromic in bases 2, 4 and 16:")
Line 1,239 ⟶ 1,266:
}
}
for (chunk in Lst.chunks(numbers, 8)) Fmt.printtprint("$,6d", chunknumbers, 8)
System.print("\nFound %(numbers.count) such numbers.")</syntaxhighlight>
 
158

edits