freeCodeCamp/problem-168-number-rotations.english.md at ef79ddd0de35a4e10b8b4588e67938f86d2bae10

Files

mrugesh 22afc2a0ca feat(learn): python certification projects (#38216 )

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>

2020-05-27 13:19:08 +05:30

1015 B

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f4151000cf542c50ff27	5	false	Problem 168: Number Rotations	301802

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.

Instructions

Tests

tests:
  - text: <code>euler168()</code> should return 59206.
    testString: assert.strictEqual(euler168(), 59206);

Challenge Seed

function euler168() {
  // Good luck!
  return true;
}

euler168();

Solution

// solution required

1015 B Raw Blame History Unescape Escape