freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-141-investigating-p...

1.3 KiB

id challengeType title forumTopicId
5900f3f91000cf542c50ff0b 5 Problem 141: Investigating progressive numbers, n, which are also square 301770

Description

A positive integer, n, is divided by d and the quotient and remainder are q and r respectively. In addition d, q, and r are consecutive positive integer terms in a geometric sequence, but not necessarily in that order. For example, 58 divided by 6 has quotient 9 and remainder 4. It can also be seen that 4, 6, 9 are consecutive terms in a geometric sequence (common ratio 3/2). We will call such numbers, n, progressive. Some progressive numbers, such as 9 and 10404 = 1022, happen to also be perfect squares. The sum of all progressive perfect squares below one hundred thousand is 124657. Find the sum of all progressive perfect squares below one trillion (1012).

Instructions

Tests

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

Challenge Seed

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

euler141();

Solution

// solution required