freeCodeCamp/problem-66-diophantine-equation.english.md at 1f310d8c5877a13cf67fbfaad323b4a558a0ac3c

Files

Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828 )

* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown

2018-10-20 23:32:47 +05:30

1.2 KiB

Raw Blame History

id, challengeType, title

id	challengeType	title
5900f3ae1000cf542c50fec1	5	Problem 66: Diophantine equation

Description

Consider quadratic Diophantine equations of the form: x2 – Dy2 = 1 For example, when D=13, the minimal solution in x is 6492 – 13×1802 = 1. It can be assumed that there are no solutions in positive integers when D is square. By finding minimal solutions in x for D = {2, 3, 5, 6, 7}, we obtain the following: 32 – 2×22 = 1 22 – 3×12 = 192 – 5×42 = 1 52 – 6×22 = 1 82 – 7×32 = 1 Hence, by considering minimal solutions in x for D ≤ 7, the largest x is obtained when D=5. Find the value of D ≤ 1000 in minimal solutions of x for which the largest value of x is obtained.

Instructions

Tests

tests:
  - text: <code>euler66()</code> should return 661.
    testString: assert.strictEqual(euler66(), 661, '<code>euler66()</code> should return 661.');

Challenge Seed

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

euler66();

Solution

// solution required

1.2 KiB Raw Blame History Unescape Escape