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: Fermat primality test | Statement: [Carmichael number, relatedTo, Fermat primality test]

Target entity: Fermat primality test
Context triple: [Carmichael number, relatedTo, Fermat primality test]

• A. Fermat primality test chosen
  The Fermat primality test is a probabilistic algorithm that checks whether a number is prime by verifying congruences derived from Fermat's little theorem.
• B. Miller primality test
  The Miller primality test is a randomized algorithm used to determine whether a number is prime with high confidence, forming the basis of the widely used Miller–Rabin primality test in computational number theory and cryptography.
• C. Lucas–Lehmer test
  The Lucas–Lehmer test is a primality test specifically designed to efficiently determine whether Mersenne numbers are prime, playing a central role in the search for very large primes.
• D. Solovay–Strassen primality test
  The Solovay–Strassen primality test is a randomized algorithm in number theory that uses Euler–Jacobi pseudoprimes to more reliably distinguish prime numbers from composites than simpler tests like Fermat’s.
• E. AKS primality test
  The AKS primality test is a landmark deterministic polynomial-time algorithm that can conclusively determine whether a number is prime without relying on unproven assumptions.
• F. None of above.
• G. Unsure - the case is ambiguous/there is not enough information to decide.