Trial Division

Target entity: Trial Division
Context triple: [New York County District Attorney’s Office, hasDivision, Trial Division]

• A. trial division
  The trial division is the part of the Supreme Court of the Australian Capital Territory responsible for hearing and determining cases at first instance, including serious criminal and significant civil matters.
• B. Adleman–Pomerance–Rumely primality test
  The Adleman–Pomerance–Rumely primality test is an early deterministic algorithm in computational number theory used to determine whether a given number is prime, notable for its theoretical importance in the development of modern primality testing methods.
• C. 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.
• D. 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.
• E. Über die Anzahl der Primzahlen unter einer gegebenen Grösse
  Über die Anzahl der Primzahlen unter einer gegebenen Grösse is Bernhard Riemann’s seminal 1859 paper that introduced the Riemann zeta function and laid the foundations of analytic number theory, including the famous Riemann Hypothesis.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Target entity: Trial Division
Target entity description: The Trial Division is a unit within the New York County District Attorney’s Office responsible for prosecuting criminal cases in court from arraignment through verdict.

• A. trial division
  The trial division is the part of the Supreme Court of the Australian Capital Territory responsible for hearing and determining cases at first instance, including serious criminal and significant civil matters.
• B. Adleman–Pomerance–Rumely primality test
  The Adleman–Pomerance–Rumely primality test is an early deterministic algorithm in computational number theory used to determine whether a given number is prime, notable for its theoretical importance in the development of modern primality testing methods.
• C. 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.
• D. 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.
• E. Über die Anzahl der Primzahlen unter einer gegebenen Grösse
  Über die Anzahl der Primzahlen unter einer gegebenen Grösse is Bernhard Riemann’s seminal 1859 paper that introduced the Riemann zeta function and laid the foundations of analytic number theory, including the famous Riemann Hypothesis.
• F. None of above. chosen