22afc2a0ca
Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com> Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com> Co-authored-by: Beau Carnes <beaucarnes@gmail.com>
62 lines
1015 B
Markdown
62 lines
1015 B
Markdown
---
|
||
id: 5900f4151000cf542c50ff27
|
||
challengeType: 5
|
||
isHidden: false
|
||
title: 'Problem 168: Number Rotations'
|
||
forumTopicId: 301802
|
||
---
|
||
|
||
## Description
|
||
<section id='description'>
|
||
Consider the number 142857. We can right-rotate this number by moving the last digit (7) to the front of it, giving us 714285.
|
||
It can be verified that 714285=5×142857.
|
||
This demonstrates an unusual property of 142857: it is a divisor of its right-rotation.
|
||
Find the last 5 digits of the sum of all integers n, 10 < n < 10100, that have this property.
|
||
</section>
|
||
|
||
## Instructions
|
||
<section id='instructions'>
|
||
|
||
</section>
|
||
|
||
## Tests
|
||
<section id='tests'>
|
||
|
||
```yml
|
||
tests:
|
||
- text: <code>euler168()</code> should return 59206.
|
||
testString: assert.strictEqual(euler168(), 59206);
|
||
|
||
```
|
||
|
||
</section>
|
||
|
||
## Challenge Seed
|
||
<section id='challengeSeed'>
|
||
|
||
<div id='js-seed'>
|
||
|
||
```js
|
||
function euler168() {
|
||
// Good luck!
|
||
return true;
|
||
}
|
||
|
||
euler168();
|
||
```
|
||
|
||
</div>
|
||
|
||
|
||
|
||
</section>
|
||
|
||
## Solution
|
||
<section id='solution'>
|
||
|
||
```js
|
||
// solution required
|
||
```
|
||
|
||
</section>
|