We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. All Contests
  2. ProjectEuler+
  3. Project Euler #66: Diophantine equation
  4. Discussions

Project Euler #66: Diophantine equation

  • hamblinglen
     + 1 comment

    I'll summarize the Wikipedia/Wolfram info

    1. The minimum solution is the numerator of a continued fraction aproximation of sqrt(D)
    2. let p be the period of the continued fraction and n_i / d_i be the ith convergent in the sequence of continued fraction aproximations of sqrt(D)
    3. if D is even, the solution is n_(p-1)
    4. if D is odd, the solution is n_(2p-1)
    5. Project Euler+ problems 64 and 65 lay the groundwork for this problem

    • hamblinglen
       + 0 comments

      to clarify: n_i and d_i are the numerator and denomenator of the ith convergent respectively.

Join us

Create a HackerRank account

Be part of a 26 million-strong community of developers

Already have an account?Log in