Imagine you have \(2\) new guests arriving to the full hotel. How do you accommodate them?
What would you do about \(10000\) new guests arriving to the full hotel?
Imagine you have now a general finite number of new guests arriving to the full hotel. What do you do?
If a magician puts \(1\) dove into his hat, he pulls out \(2\) rabbits and \(2\) flowers from it. If the magician puts \(1\) rabbit in, he pulls out \(2\) flowers and \(2\) doves. If he puts \(1\) flower in, he pulls out \(1\) rabbit and \(3\) doves. The magician starts with \(1\) rabbit. Could he end up with the same number of rabbits, doves, and flowers after performing his hat trick several times?
In the other room there are two doors. The statements on them say:
There is treasure behind at least one of the doors.
There is treasure behind the first door.
Your guide says: The first sign is true if there is treasure behind the first door, otherwise it is false. The second sign is false if there is treasure behind the second door, otherwise it is true. What would you do?
In the last room, there are two doors, but someone broke into this room and the signs that used to be on the doors are now on the floor! You do not know which sign was on which door, but the statements on them say:
There is a trap behind this door.
There are traps behind both doors.
Your guide says: The first sign is true if there is treasure behind the first door, otherwise it is false. The second sign is false if there is treasure behind the second door, otherwise it is true.
But you don’t know which sign is first! What do you do?
Find the mistake in the sequence of equalities: \(-1=(-1)^{\frac{2}{2}}=((-1)^2)^{\frac{1}{2}}=1^{\frac{1}{2}}=1\).
Queen Hattius has two prisoners and gives them a puzzle. If they succeed, then she’ll let them free. She will randomly put a hat on each of their heads. The hats could be red or blue. They will simultaneously guess the colour of their own hat, and if at least one person is correct, then they win.
Each prisoner can only see the other prisoner’s hat - and not their own. The prisoners aren’t allowed to communicate once they’re wearing the hats, but they’re allowed to come up with a strategy before.
What should their strategy be?
Two children come in from playing outside, and both of their faces are muddy. Their dad says that at least one of their faces is muddy. He’ll repeat this phrase until all of the children with muddy faces have come forward. Assuming that the children can’t see or feel their own face, but that they’re perfect at logic, what happens?
Prince Hattius tests his three wisest men with a hat puzzle. He tells them that he’ll put a hat on each of their heads, either green or yellow. These wise men, used to such puzzles, know that in such a setup they’ll be able to see the colours of the other two hats, but not their own.
Then the Prince says that at least one hat is green and the winner is the first person to work out the colour of his own hat. He adds on that this puzzle is fair to all of them - what happens?