freeCodeCamp/problem-131-prime-cube-partnership.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

1.0 KiB

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f3ef1000cf542c50ff02	5	false	Problem 131: Prime cube partnership	301759

Description

There are some prime values, p, for which there exists a positive integer, n, such that the expression n3 + n2p is a perfect cube. For example, when p = 19, 83 + 82×19 = 123. What is perhaps most surprising is that for each prime with this property the value of n is unique, and there are only four such primes below one-hundred. How many primes below one million have this remarkable property?

Instructions

Tests

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

Challenge Seed

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

euler131();

Solution

// solution required

1.0 KiB Raw Blame History Unescape Escape