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 theorem | Statement: [Fermat's little theorem, generalizedBy, Euler's theorem]

Target entity: Euler's theorem
Context triple: [Fermat's little theorem, generalizedBy, Euler's theorem]

• A. Euler’s theorem chosen
  Euler’s theorem is a fundamental result in number theory stating that for any integer a coprime to n, a raised to the power of φ(n) is congruent to 1 modulo n.
• B. 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.
• C. Wilson's theorem
  Wilson's theorem is a result in number theory stating that a positive integer n > 1 is prime if and only if the factorial of (n − 1) is congruent to −1 modulo n.
• D. de Bruijn–van Aardenne–Ehrenfest theorem
  The de Bruijn–van Aardenne–Ehrenfest theorem is a fundamental result in combinatorics that characterizes the number of Eulerian circuits in directed graphs, particularly de Bruijn graphs, and underpins constructions in coding theory and discrete mathematics.
• E. Fermat's Last Theorem
  Fermat's Last Theorem is a famous statement in number theory asserting that there are no whole-number solutions to the equation xⁿ + yⁿ = zⁿ for integers n greater than 2, a problem that remained unsolved for over three centuries until it was proved by Andrew Wiles in the 1990s.
• F. None of above.
• G. Unsure - the case is ambiguous/there is not enough information to decide.