freeCodeCamp/problem-132-large-repunit-factors.english.md at 908adc2c372f2c1af0c8d1c80b264c23f96fd7d7

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

933 B

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f3f11000cf542c50ff03	5	false	Problem 132: Large repunit factors	301760

Description

A number consisting entirely of ones is called a repunit. We shall define R(k) to be a repunit of length k. For example, R(10) = 1111111111 = 11×41×271×9091, and the sum of these prime factors is 9414. Find the sum of the first forty prime factors of R(109).

Instructions

Tests

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

Challenge Seed

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

euler132();

Solution

// solution required

933 B Raw Blame History Unescape Escape