perplexus.info :: Algorithms : Tautonymic number counting

Tautonymic number counting (Posted on 2022-09-04)

Suppose you want to know how many tautonymic numbers are in the set of integers from 1 to N.

Can you provide a formula for this?
Otherwise, can you devise an algorithm, as efficient as possible, to find the answer?
Are there special values of N for which there is a simple formula?

Submitted by K Sengupta

Rating: 5.0000 (1 votes)

Solution: (Hide)

Refer to the solution submitted by Charlie in this location.

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 (7)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info