We’re rewarding the question askers & reputations are being recalculated! Read more.

# Search Results

Results tagged with Search options user 68
17 results

A puzzle that requires formal logical deduction to arrive at the solution. This suggests more than merely reasoning through clues to find an answer (you might want [situation] for that).

We have an amount of red sand $R$ and an amount of blue sand $U$. $R$ does not have to be equal to $U$. We pour our sand in two beakers, so that beaker A contains all the red sand and beaker B contain …
answered Oct 27 '14 by SQB
This way, each sibling got to either divide or choose and should be happy. This is different from the cake solution, since a cake can be cut, but not joined. To address some points raised in t …
answered Oct 15 '14 by SQB
Right now, we have $x$ minutes left until 6 o'clock. 50 minutes ago, it was $4x$ minutes past 3 o'clock. That means that the time between 3 o'clock and 6 o'clock, 180 minutes, is equal to the sum of t …
answered May 22 '14 by SQB
In Heinlein's Space Cadet, one of many tests administered to the protagonist seems to have no way of scoring any points. See the excerpt below. Late in the day he was ushered into a cubbyhole cont …
asked May 22 '14 by SQB
If you have to bury yourself up to your neck, you need your arms to do so. While there may be sand up to your neck, your arms will have been free enough to dig yourself in, so they will be free enough …
answered Oct 22 '14 by SQB
With three children, three red hats and two black hats, there are 7 different configurations possible: $$\begin{array}{cccl} \text{Alice} & \text{Bob} & \text{Carol} \\ \\ \hline \text{red} & \text … answered May 20 '14 by SQB Since they both claim to be a different one of the available options, they're either both "truthing" or both lying. Since at least one of them is lying, they're not both speaking the truth and so the … answered Feb 1 '16 by SQB For a total of n cars, of which w are white, r are red, g are green, and c have another colour:$$\begin{align} n & , w, r, g, c \in \mathbb{Z}_{\ge 0} \tag{1} \label{eq1} \\ n & = w + …
Let's put the number of coins at $c$ and see what happens if we increase $n$. We'll number the pirates from meekest ($1$) to fiercest ($n$). $\begin{array}{rrrll} \begin{array}{c}\text{Nr. of pirat … answered May 20 '14 by SQB Within a group of$n$teams, there are$\frac{n (n - 1)}{2}$points to share. But that goes for each subgroup as well. A subgroup of m teams, where$m < n$, will have$\frac{m (m - 1)}{2}$points betw … answered May 15 '14 by SQB No, they cannot escape. Mark sees his window with the 12 bars. He can deduce Rose has either 6 or 8 bars in her window. He does not know which. However, he can deduce that Rose will have deduced he h … answered Nov 15 '16 by SQB I've answered this over on Math.SE, so I'll just quote most of that. Suppose we have$n$doors, with a car behind$1\$ of them. The probability of choosing the door with the car behind it on your f …