You reach a fork in a road: one path leads to Truth City while the other leads to Lies City.

You encounter a man who you know is either from Truth City or Lies City. If he is from Truth City, he will tell the truth, and if he from Lies City, he will lie.

What question will make him point to Truth City?

\[ \begin{array} { rrrrr } & & & & & A \\ & & & & A & A \\ & & & A & A & A \\ + & & A & A & A & A \\ \hline & \large\square & \large\square & \large\square & \large\square & \large\square \\ \end{array} \]

The above is an incomplete cryptogram, where \(A\) is a positive, single-digit integer. As shown, the final sum is a 5-digit number.

What is this final sum?

Bobo the Clown wants to cross a bridge over dangerous waters while performing a three ring juggle, in which one or two rings are in the air at all times. The bridge can support a maximum weight of \(\SI[per-mode=symbol]{1000}{\newton},\) above which it will collapse. Each ring weighs \(\SI[per-mode=symbol]{100}{\newton}\) and Bobo himself weighs \(\SI[per-mode=symbol]{800}{\newton}.\)

Coco the Clown tells Bobo that it will be safe to cross the bridge as long as Bobo is **never** holding all three rings at once. Dodo the Clown disagrees, arguing that the juggle will collapse the bridge, even if at least one ring is in the air at all times.

Who is correct, Coco or Dodo?

We have a \(1\times 1\times 1\) orange cube on a piece of \(3\times 3\) blue paper. **Is it possible to cover the entire cube with the paper under the following conditions?**

- The paper can only be cut or folded along the grid.
- The cut should not cause the paper to separate into pieces.

×

Problem Loading...

Note Loading...

Set Loading...