query: John von Neumann- Exercise about a Fly and two Trains
positive_passages.docid: 17527
positive_passages.text: Fly and Two Trains Riddle
negative_passages.docid: 78787
negative_passages.text: Circuit construction for Hamiltonian simulation
negative_passages.docid: 130464
negative_passages.text: Exercise 2.11 Atiyah-Macdonald
negative_passages.docid: 34493
negative_passages.text: Concrete Mathematics - The Josephus Problem
negative_passages.docid: 28645
negative_passages.text: Alice and Bob play the determinant game
negative_passages.docid: 156076
negative_passages.text: Human between two bodies of large mass
negative_passages.docid: 141496
negative_passages.text: Could someone make the proof into a hinted exercise?
negative_passages.docid: 141101
negative_passages.text: Russia (2000) contest:Prove the existence of a pair of rows and columns with intersections differently coloured
negative_passages.docid: 12291
negative_passages.text: Two envelope problem revisited
negative_passages.docid: 20174
negative_passages.text: Discrete mathematics bit strings
negative_passages.docid: 10272
negative_passages.text: A three-way duel (probability puzzle)
negative_passages.docid: 359
negative_passages.text: Show that $\ker \hat{T} = \text{ann}(\text{range } T)$
negative_passages.docid: 66092
negative_passages.text: Simultaneous diagonalization of commuting linear transformations
negative_passages.docid: 124953
negative_passages.text: A loss and gain problem
negative_passages.docid: 64658
negative_passages.text: How many associative binary operations for a set of two elements?
negative_passages.docid: 130244
negative_passages.text: Exercise similar to prime avoidance theorem in R.Y. Sharp's textbook
negative_passages.docid: 11296
negative_passages.text: The Monty Hall problem