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