Lebesgue–Nagell equation

Target entity: Lebesgue–Nagell equation
Context triple: [Ramanujan–Nagell equation, relatedTo, Lebesgue–Nagell equation]

• A. Ramanujan–Nagell equation
  The Ramanujan–Nagell equation is a famous Diophantine equation in number theory that has only finitely many integer solutions and is closely associated with the work of Srinivasa Ramanujan.
• B. Erdős–Moser equation
  The Erdős–Moser equation is a famous unsolved Diophantine equation in number theory that asks whether 1^k + 2^k + ... + (m−1)^k = m^k has any integer solutions beyond the trivial case (k, m) = (1, 2).
• C. Fermat's theorem on sums of two squares
  Fermat's theorem on sums of two squares is a result in number theory stating exactly which prime numbers (and, more generally, which integers) can be expressed as the sum of two perfect squares.
• D. Fermat polygonal number theorem
  The Fermat polygonal number theorem is a result in number theory stating that every positive integer can be expressed as a sum of a fixed number of polygonal numbers of a given order.
• E. Diophantine equations
  Diophantine equations are polynomial equations for which only integer or rational solutions are sought, forming a central and often notoriously difficult area of number theory.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Lebesgue–Nagell equation
Target entity description: The Lebesgue–Nagell equation is a Diophantine equation of the form \(x^2 + D = y^n\) (with fixed integers \(D\) and \(n \ge 3\)) studied in number theory for its finite and often explicitly determinable set of integer solutions.

• A. Ramanujan–Nagell equation
  The Ramanujan–Nagell equation is a famous Diophantine equation in number theory that has only finitely many integer solutions and is closely associated with the work of Srinivasa Ramanujan.
• B. Erdős–Moser equation
  The Erdős–Moser equation is a famous unsolved Diophantine equation in number theory that asks whether 1^k + 2^k + ... + (m−1)^k = m^k has any integer solutions beyond the trivial case (k, m) = (1, 2).
• C. Fermat's theorem on sums of two squares
  Fermat's theorem on sums of two squares is a result in number theory stating exactly which prime numbers (and, more generally, which integers) can be expressed as the sum of two perfect squares.
• D. Fermat polygonal number theorem
  The Fermat polygonal number theorem is a result in number theory stating that every positive integer can be expressed as a sum of a fixed number of polygonal numbers of a given order.
• E. Diophantine equations
  Diophantine equations are polynomial equations for which only integer or rational solutions are sought, forming a central and often notoriously difficult area of number theory.
• F. None of above. chosen