A) n cannot be a prime number B) n must be a positive integer C) n cannot equal 4 or 5 modulo 9 D) n must be a multiple of 9
A) 0, 3, and 6 B) 0, 1, and -1 C) 1, 4, and 7 D) 1, 2, and 3
A) It proves the sum of cubes is infinite B) It provides a counterexample to Fermat's Last Theorem for exponent three C) It results in a negative sum D) It implies the number 0 is prime
A) Louis J. Mordell B) K. Mahler C) Andrew Sutherland D) Andrew Booker
A) K. Mahler B) Noam Elkies C) Timothy Browning D) A.S. Verebrusov
A) 0 and 1 B) 1 and 2 C) 3 and 4 D) 2 and 3
A) He found an infinite family of solutions B) He proved it was impossible C) He identified a counterexample D) He did not know anything more than the small solutions
A) Noam Elkies' method involving lattice reduction B) Brute force search only C) Fermat's method of infinite descent D) Quartic polynomial parameterization
A) Timothy Browning B) Andrew Sutherland C) Louis J. Mordell D) Andrew Booker
A) 33 B) 165 C) 74 D) 42
A) Noam Elkies B) K. Mahler C) Andrew Sutherland D) Andrew Booker
A) It searches only for positive integers B) It has a running time proportional to the minimum of |x|, |y|, |z| C) It uses random sampling D) It uses a supercomputer only
A) Noam Elkies and Timothy Browning B) K. Mahler and A.S. Verebrusov C) Elsenhans and Jahnel D) Andrew Booker and Andrew Sutherland
A) A local university cluster B) A single supercomputer in London C) Charity Engine global grid D) A custom-built quantum computer
A) Whether 0 can be represented as a sum of three non-zero cubes B) Whether all integers have a representation as a sum of rational cubes C) Whether the necessary condition (n not equal 4 or 5 mod 9) is sufficient D) Whether 1 and 2 have infinitely many representations
A) Timothy Browning B) Bjorn Poonen C) Brady Haran D) Andrew Sutherland
A) 2015 B) 1992 C) 2016 D) 2019
A) MIT B) Oxford C) Cambridge D) Harvard
A) Unknown B) Undecidable C) Decidable D) Proven to be infinite
A) Roger Heath-Brown B) Timothy Browning C) Andrew Booker D) Bjorn Poonen
A) Quanta Magazine B) Popular Mechanics C) Scientific American D) New Scientist
A) The Hilbert Conference B) Fields Medal Symposium C) International Congress of Mathematicians D) Algorithmic Number Theory Symposium
A) Fermat's Last Theorem B) Goldbach's Conjecture C) Riemann Hypothesis D) Hilbert's tenth problem
A) They are finite in number B) They have positive natural density C) They have a density of exactly one D) They have zero natural density
A) Complex numbers B) Negative integers C) Rational numbers D) Irrational numbers
A) 18th century B) 19th century C) 21st century D) 20th century |