Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: Euler’s criterion | Statement: [Gauss’s lemma (number theory), relatedTo, Euler’s criterion]

Target entity: Euler’s criterion
Context triple: [Gauss’s lemma (number theory), relatedTo, Euler’s criterion]

• A. 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.
• B. Gauss’s lemma in number theory
  Gauss’s lemma in number theory is a result that relates the Legendre symbol to the number of sign changes in a certain sequence of multiples, providing a practical criterion for determining quadratic residues modulo an odd prime.
• C. Fermat's little theorem
  Fermat's little theorem is a fundamental result in number theory that characterizes how prime numbers interact with integer powers modulo that prime, forming the basis for many modern cryptographic algorithms.
• 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. Euler’s totient function φ(n)
  Euler’s totient function φ(n) is a fundamental arithmetic function in number theory that counts the positive integers up to n that are relatively prime to n and plays a key role in topics such as modular arithmetic and cryptography.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: Euler’s criterion
Triple: [Gauss’s lemma (number theory), relatedTo, Euler’s criterion]

Euler’s criterion is a fundamental result in number theory that characterizes quadratic residues modulo an odd prime using exponentiation in modular arithmetic.

Target entity: Euler’s criterion
Target entity description: Euler’s criterion is a fundamental result in number theory that characterizes quadratic residues modulo an odd prime using exponentiation in modular arithmetic.

• A. 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.
• B. Gauss’s lemma in number theory chosen
  Gauss’s lemma in number theory is a result that relates the Legendre symbol to the number of sign changes in a certain sequence of multiples, providing a practical criterion for determining quadratic residues modulo an odd prime.
• C. Fermat's little theorem
  Fermat's little theorem is a fundamental result in number theory that characterizes how prime numbers interact with integer powers modulo that prime, forming the basis for many modern cryptographic algorithms.
• 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. Euler’s totient function φ(n)
  Euler’s totient function φ(n) is a fundamental arithmetic function in number theory that counts the positive integers up to n that are relatively prime to n and plays a key role in topics such as modular arithmetic and cryptography.
• F. None of above.