61 lines
1.5 KiB
Markdown
61 lines
1.5 KiB
Markdown
---
|
|
id: 5900f3dd1000cf542c50feef
|
|
challengeType: 5
|
|
title: 'Problem 112: Bouncy numbers'
|
|
---
|
|
|
|
## Description
|
|
<section id='description'>
|
|
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 just over half of the numbers below one-thousand (525) are bouncy. In fact, the least number for which the proportion of bouncy numbers first reaches 50% is 538.
|
|
Surprisingly, bouncy numbers become more and more common and by the time we reach 21780 the proportion of bouncy numbers is equal to 90%.
|
|
Find the least number for which the proportion of bouncy numbers is exactly 99%.
|
|
</section>
|
|
|
|
## Instructions
|
|
<section id='instructions'>
|
|
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler112()</code> should return 1587000.
|
|
testString: 'assert.strictEqual(euler112(), 1587000, "<code>euler112()</code> should return 1587000.");'
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function euler112() {
|
|
// Good luck!
|
|
return true;
|
|
}
|
|
|
|
euler112();
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
</section>
|