Home > Numbers
| Palindromic number counting (Posted on 2006-06-22) |
 |
Suppose you want to know how many palindromes are in the set of integers from 1 to N. Can you provide a formula for this? Otherwise, can you give an algorithm, as efficient as possible, to find the answer? And, are there special values of N for which there is a simple formula?
|
No Solution Yet
|
Submitted by Sir Percivale
|
|
Rating: 3.6667 (3 votes)
|
|
Comments: (
You must be logged in to post comments.)
|
|
Please log in:
Forums (0)
Newest Problems
Random Problem
FAQ |
About This Site
Site Statistics
New Comments (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On
Chatterbox:
|
