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: fundamental theorem of arithmetic | Statement: [An Introduction to the Theory of Numbers, coversConcept, fundamental theorem of arithmetic]

Target entity: fundamental theorem of arithmetic
Context triple: [An Introduction to the Theory of Numbers, coversConcept, fundamental theorem of arithmetic]

• A. prime number theorem
  The prime number theorem is a fundamental result in number theory that describes how prime numbers become less frequent and provides an approximate formula for the number of primes less than a given large number.
• 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. 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.
• D. 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.
• E. Euler’s theorem
  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.
• 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: fundamental theorem of arithmetic
Triple: [An Introduction to the Theory of Numbers, coversConcept, fundamental theorem of arithmetic]

The fundamental theorem of arithmetic states that every integer greater than 1 can be written uniquely (up to the order of factors) as a product of prime numbers.

Target entity: fundamental theorem of arithmetic
Target entity description: The fundamental theorem of arithmetic states that every integer greater than 1 can be written uniquely (up to the order of factors) as a product of prime numbers.

• A. prime number theorem
  The prime number theorem is a fundamental result in number theory that describes how prime numbers become less frequent and provides an approximate formula for the number of primes less than a given large number.
• 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. 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.
• D. 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.
• E. Euler’s theorem
  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.
• F. None of above. chosen