- #1
niwaone
- 8
- 0
Homework Statement
1.During a certain movie, each person of a set of five audience members fell asleep exactly twice. For each pair of these people, there was some moment when both were sleeping simultaneously. Is it true that, at some moment, three of them must have been sleeping simultaneously?
2. Given a set of two million points randomly placed on a piece of paper. Can you always draw a straight line on the paper so that on each side of the line there are exactly one million points?
3. A group of friends play a round-robin chess tournament, which means that everyone plays a game with everyone else exactly once. The tournament rules do not allow draws. Is it always possible to line up the players in such a way that the first player beats the second, who beats the third, etc.? Would this way of lining up the players be unique?
4. At the beginning of the morning the conference room in a large hall stands empty. Each minute, either one person enters or two people leave. The guestbook for the conference room shows that after exactly 31999 minutes, the room contained exactly 31000 + 2 people. Is the guestbook record accurate?
5. An alien lock has 16 keys arranged in a 4 × 4 grid, each key is either pointing horizontally or vertically. In order to open the lock, you must make sure that all the keys must be vertically oriented, by switching the orientation of one key at a time. When a key is switched to another position, all the other keys in the same row and column automatically switch their orientations too (i.e. vertical to horizontal, horizontal to vertical). Is it true that no matter what the initial positions of the 16 keys are, it is always possible to open this lock?
The Attempt at a Solution
1. I don't get number 1 but what I think is this problem is relevant to Eulerian path/circuit! I think that we can call 5 people A, B, C, D, E and then connect them like a star shape. After that, we can test the "Seven Bridges of Königsberg" theory.
2. I think no because there's too much point and it's nearly impossible to estimate each side must be 1 million points
3. I don't get how to set up the round-robin tournament and solve this problem :O
4. I predict this question is relevant to Congruence relation (mod) but I'm not sure
5. Can someone get this question?
These are very brainy and tricky questions, and they aren't advance math or something. The way to solve them is your thinking skill? (my teacher said that). I hope someone can help me. Thank you very much
Last edited: