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