A) The first theorem of arithmetic B) The first proof in geometry C) The first theorem of calculus D) The first theorem of graph theory
A) Calculus B) Arithmetic C) Combinatorics D) Topology
A) World War II B) Euler's lifetime C) The 19th century D) Antiquity
A) The number of bridges and the list of their endpoints B) The length and width of each bridge C) The building materials of the bridges D) The depth of the river beneath the bridges
A) Trigonometry B) Statistics C) Algebra D) Topology
A) Graph schematics B) The rigid shape of objects C) The number of endpoints D) Connectivity between nodes
A) An irrelevant abstraction B) A science of strict quantities C) Something more general D) A subset of Euclidean geometry
A) The Pythagorean view that all is number B) The Euclidean view of parallel lines C) The Platonic view of unchanging forms D) The Aristotelian view that mathematics is the science of quantity
A) Abstract algebra and topology B) Arithmetic and Euclidean geometry C) Topology and graph theory D) Network theory and combinatorics
A) It fails to apply to the physical world B) It is purely an imaginary abstraction C) It is directly about the real arrangement of bridges D) It requires a computer model to be valid
A) The ambiguity of topological shapes B) The uncertainty of quantum mechanics C) The approximation of physical measurements D) The certainty of mathematical proof
A) it relies entirely on empirical observation B) It is purely descriptive without explanation C) It is explanatory, giving insight into why the result must be true D) It is probabilistic rather than definitive
A) A major earthquake in the 18th century B) The bombing of Königsberg in World War II C) A massive flood prior to Euler's time D) The construction of the Erskine Building
A) They were preserved as historical monuments B) They collapsed due to heavy traffic C) They were demolished and replaced by a highway D) They were incorporated into an ice hockey arena
A) Zero B) Two C) One D) Three
A) 2018 B) 2014 C) 1935 D) 1945
A) Five B) Two C) Three D) Seven
A) 2 B) 4 C) 3 D) 1
A) 3 B) 4 C) 5 D) 2
A) No, an Eulerian path is still completely impossible B) Yes, but it must begin on one island and end on the other C) Only if two more bridges are demolished D) Yes, and it can form a complete closed circuit
A) Georgia Institute of Technology B) The University of Canterbury in Christchurch C) University of Königsberg D) Rochester Institute of Technology
A) The Statistics Department and the Computer Science Library B) The old Physical Sciences Library and the Erskine Building C) The Central Island Library and the Science Building D) The Gene Polisseni Center and the Mathematics Department
A) Departments of History, Philosophy and Literature B) Departments of Civil and Mechanical Engineering C) Departments of Physics, Chemistry and Biology D) Departments of Mathematics, Statistics and Computer Science
A) Short bushes B) Flowing streams C) Stone pathways D) Pavement and concrete
A) A modern fountain B) A historical plaque C) A stone tōrō D) A bronze statue of Euler
A) Georgia Institute of Technology B) Rochester Institute of Technology C) University of Bristol D) University of Canterbury
A) The Erskine Building B) The Physical Sciences Library C) The Bristol Arena D) The Gene Polisseni Center
A) 1935 B) 1945 C) 2014 D) 2018
A) Rochester Institute of Technology B) Georgia Institute of Technology C) University of Canterbury D) University of Bristol
A) The Königsberg Circuit Tour B) The Euler Path Challenge C) The Canterbury River Walk D) The Bristol Bridges Walk
A) Two river banks and three river islands B) Two river banks and two river islands C) One river bank and three river islands D) Three river banks and one river island
A) 7 B) 3 C) 5 D) 45
A) An Eulerian circuit is impossible B) Only an Eulerian path is possible C) An Eulerian circuit exists D) All nodes have an odd degree
A) By a mandatory university curriculum B) By government decrees C) By a book and news coverage D) By a blockbuster movie and video games
A) Professional ice hockey tournaments B) Different charity events C) International math olympiads D) Political election campaigns
A) Building a new bridge in the city B) Counting the total population of Königsberg C) Walking tour crossing each bridge exactly once D) Sailing tour around the Pregel River
A) Carl Hierholzer B) St. Petersburg Academy C) James R. Newman D) Leonhard Euler
A) 1735 B) 1736 C) 1750 D) 1741
A) Kaliningrad B) Altstadt C) Prussia D) St. Petersburg
A) Five B) Six C) Seven D) Four
A) A circuit B) A vertex or node C) A bridge D) An edge
A) Two B) Five C) Four D) Zero
A) Carl Hierholzer B) Leonhard Euler C) James R. Newman D) St. Petersburg Academy
A) Only if there are four odd nodes B) No C) Always D) Yes
A) 26 August 1735 B) 26 August 1741 C) 26 August 1736 D) 26 August 1750
A) 1745 B) 1736 C) 1741 D) 1735
A) Commentarii academiae scientiarum Petropolitanae B) The World of Mathematics C) The Seven Bridges of Königsberg D) Solutio problematis ad geometriam situs pertinentis
A) Commentarii academiae scientiarum Petropolitanae B) St. Petersburg Academy Journal C) Solutio problematis D) The World of Mathematics
A) Topologically sound B) Eulerian circuits C) Sufficient conditions D) Explicitly unacceptable |