Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re^3: Challenge: Nearest Palindromic Number

by Roy Johnson (Monsignor)
on Feb 02, 2005 at 19:37 UTC ( [id://427391]=note: print w/replies, xml ) Need Help??


in reply to Re^2: Challenge: Nearest Palindromic Number
in thread Challenge: Nearest Palindromic Number

I hadn't seen that at the time I posted. And I had modified it by the time your response showed up. Now I've modified it again, and I think it's airtight. :-)

Caution: Contents may have been coded under pressure.
  • Comment on Re^3: Challenge: Nearest Palindromic Number

Replies are listed 'Best First'.
Re^4: Challenge: Nearest Palindromic Number
by Limbic~Region (Chancellor) on Feb 02, 2005 at 19:59 UTC
    Roy Johnson,
    I tested it from N = 1 to N = 332_288 1_500_000 as well as 11_441 random numbers between 1 and 999_999_999. It provided acceptable solutions for all of them. Good job.

    Cheers - L~R

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://427391]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others avoiding work at the Monastery: (4)
As of 2024-04-25 16:21 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found