Rosetta Code

Find palindromic numbers in both binary and ternary bases: Difference between revisions

Page Discussion

Find palindromic numbers in both binary and ternary bases (view source)

Revision as of 21:14, 15 April 2024

135 bytes removed ,  1 month ago
m
→‎{{header|EasyLang}}
 
Line 719:
 
=={{header|EasyLang}}==
{{trans|C}}
<syntaxhighlight>
fastfunc ispalin2 n .
if n mod 2 = 0
return 0
.
m = n
while m > 0
Line 736 ⟶ 732:
fastfunc reverse3 n .
while n > 0
xr = xr * 3 + n mod 3
n = n div 3
.
return xr
.
procfunc$ outxitoa n base .b .
writeif "n "> 0
return itoa (n div b) b & n mod b
repeat
write strchar (48 + n mod base)
n = n div base
until n = 0
.
write "(" & base & ")"
.
proc show n . .
write n
outx n 2
outx n 3
print ""
.
proc main . .
showprint "0 0(2) 0(3)"
cntprint ="1 1(2) 1(3)"
pow3 = 13
while 1 = 1
for i = pow3ppow3 / 3 to pow3 - 1
# Assumptionassumption that the middle digit must be 1
n = (i * 3 + 1) * pow3 + reverse3 i
if ispalin2 n = 1
showprint n & " " & itoa n 2 & "(2) " & itoa n 3 & "(3)"
cnt += 1
if cnt = 6 - 2
return
.
.
.
pow3p = pow3
pow3 *= 3
.
Chkas
2,008

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/363705"