All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
Ascending numbers! (Posted on 2003-05-25) Difficulty: 3 of 5
Let's call n an ascending number, if it has the following 2 properties:

- The number n has at least 2 digits.
- All digits of n are in ascending order, in base 10.

How many ascending numbers are there?

See The Solution Submitted by Fernando    
Rating: 3.0000 (3 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: solution | Comment 2 of 5 |
(In reply to solution by Charlie)

That is a stunning answer Charlie. The beauty is in the simplicity.

Though, for sake for completion, I do think one must take a view on whether the problem, as stated, allows the legitimate use of leading zeros or not, rather than leave it at two optional answers.

Personally, I think leading zeros not only can, but must be used. So the answer, according to me, would be a definite '1013' and not a conditional '502 or 1013', depending on whether we want to consider leading zeros or not.

I guess it boils down to whether, for example, we can consider 012 and 12 as different 'numbers' or not. I believe they are different numbers (one is a two digit number and the other is a three digit number) with the same quantitative value rather than being the 'same' number.
  Posted by Sanjay on 2003-05-25 07:17:08

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

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information