Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re^4: Challenge: Nearest Palindromic Number

by Limbic~Region (Chancellor)
on Feb 02, 2005 at 19:59 UTC ( [id://427402]=note: print w/replies, xml ) Need Help??


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

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

  • Comment on Re^4: Challenge: Nearest Palindromic Number

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others examining the Monastery: (3)
As of 2024-04-24 05:19 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found