perplexus.info :: Numbers : Palindromic number counting

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.)

Subject	Author	Date
solved with C source code	cheesesteak	2006-06-23 23:21:02
Zeroes allowed?	Old Original Oskar!	2006-06-22 12:47:15
special values (spoiler for that part)	Charlie	2006-06-22 09:41:13

Please log in:

Login:
Password:
Remember me:

Sign up! \| Forgot password

Search:

Search body:

Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (14)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info