Problem 42377. Bouncy numbers
Inspired by Project Euler n°112.
- Working from left-to-right if no digit is exceeded by the digit to its left it is called an increasing number. For example: 134468.
- Similarly if no digit is exceeded by the digit to its right it is called a decreasing number. For example: 66420.
We shall call a positive integer that is neither increasing nor decreasing a bouncy number. For example, 155349.
Clearly there cannot be any bouncy numbers below one-hundred, but surprisingly, these numbers become more and more common after.
Find the least number for which the proportion of bouncy numbers is exactly p%.
As always this type of problem is difficult to solve with usual Matlab functions (num2str).
So keep an eye on time...
Solution Stats
Problem Comments
-
2 Comments
James
on 15 Jun 2015
I think the problem statement should read "the proportion of bouncy numbers is at least p%", rather than "exactly p%."
Rafael S.T. Vieira
on 9 Aug 2020
Currently, num2str is able to handle all test cases.
Solution Comments
Show commentsGroup

Project Euler IV
- 11 Problems
- 16 Finishers
- Bouncy numbers
- Generalised Hamming Number
- Project Euler 249: Prime Subset Sums
- Pseudo Square Root (Inspired by Project Euler 266)
- Golomb's self-describing sequence (based on Euler 341)
- Pandigital Factors (Based on Euler 491)
- Pandigital Multiples of 11 (based on Project Euler 491)
- It's going down. We're finding simbers!
- Odd elimination
- Decimation
- Day counter function
Problem Recent Solvers38
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!