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

Files

Oliver Eyton-Williams f1c9b08cf3 fix(curriculum): add isHidden: false to challenges

This includes certificates (where it does nothing), but does not
include any translations.

2020-05-25 16:25:19 +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