ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
45 lines
780 B
Markdown
45 lines
780 B
Markdown
---
|
||
id: 5900f4151000cf542c50ff27
|
||
title: 'Problem 168: Number Rotations'
|
||
challengeType: 5
|
||
forumTopicId: 301802
|
||
dashedName: problem-168-number-rotations
|
||
---
|
||
|
||
# --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.
|
||
|
||
# --hints--
|
||
|
||
`euler168()` should return 59206.
|
||
|
||
```js
|
||
assert.strictEqual(euler168(), 59206);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler168() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler168();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|