The message below is being cross-posted from the LogoForum. Please
reply here at comp.lang.logo and it will be crossposted back to the
LogoForum. The original author of this message is "Daniel Ajoy"
<da.ajoy@[EMAIL PROTECTED]
>.
On 25 Apr 2007 at 10:52, LogoForum@[EMAIL PROTECTED]
wrote:
> Now, to get to the point. Is their a way around it?
> Or is the software limited (not that I'm complaining though)?
yes.
change this line:
make "z :x + :y
to this:
make "z lsum :x :y
and use my lsum procedure:
to lsum :n1 :n2 [:rest 0] [:resp "||] [:parcial :rest + (last :n1) +
last :n2]
if (and (not emptyp :resp) (:rest = 0) (:n1 = 0) (:n2 = 0)) [output
:resp]
output (lsum
ifelse 1 < count :n1 [butlast :n1] [0]
ifelse 1 < count :n2 [butlast :n2] [0]
(count :parcial) - 1
word (last :parcial) :resp)
end
> Also do any math heads out there know if there are numbers that never
> become palindromes?
yes. wikipedia has the details.
Daniel
> Are these those numbers? (196 295 394 493 592 ... run from 1 to
> 600)
