MyO;
0 appears 1 time
1 appears 11 times
2 appears 2 times!
Every other number appears 1 time.
Possibility 1:
The number of times the digit 0 appears in this puzzle is 1.
The number of times the digit 1 appears in this puzzle is 7.
The number of times the digit 2 appears in this puzzle is 3.
The number of times the digit 3 appears in this puzzle is 2.
The number of times the digit 4 appears in this puzzle is 1.
The number of times the digit 5 appears in this puzzle is 1.
The number of times the digit 6 appears in this puzzle is 1.
The number of times the digit 7 appears in this puzzle is 2.
The number of times the digit 8 appears in this puzzle is 1.
The number of times the digit 9 appears in this puzzle is 1.
Possibility 2:
The number of times the digit 0 appears in this puzzle is 1.
The number of times the digit 1 appears in this puzzle is 11.
The number of times the digit 2 appears in this puzzle is 2.
The number of times the digit 3 appears in this puzzle is 1.
The number of times the digit 4 appears in this puzzle is 1.
The number of times the digit 5 appears in this puzzle is 1.
The number of times the digit 6 appears in this puzzle is 1.
The number of times the digit 7 appears in this puzzle is 1.
The number of times the digit 8 appears in this puzzle is 1.
The number of times the digit 9 appears in this puzzle is 1.
MyO said, "There are ten statements. Statement 9 says that nine of those are untrue. And it works. Statement 9 is true and therefore all others ARE untrue."
The ten statements all contradict each other. So there can be at most one statement true. Now suppose there is no statement true. That would mean that statement 10 indeed would be true, which results in a contradiction. This means that exactly nine statements must be untrue, and thus only statement 9 is true.
A birthday must be cut into eight equally sized pieces.
The Question: How can the cake be cut into eight pieces with only 3 straight cuts
Consider a silver and a golden pot, one of them containing a treasure. Assume that you can determine from the text prints which pot contains the treasure.
The text prints on the pots are:
The silver pot: "This pot is empty."
The golden pot: "Exactly one of these texts is true."
The Question: Which pot contains the treasure
Consider a grid of size 4 x 4 (i.e. sixteen squares), where all squares should get a color. The colored grid should meet the following conditions:
. 4 squares should be colored blue,
. 3 squares should be colored red,
. 3 squares should be colored white,
. 3 squares should be colored green,
. 3 squares should be colored yellow, and
. no color may appear more than once in any horizontal, vertical, or diagonal line.
The Question: How can the grid be colored?