MHB Solve Fun Logic Puzzle: 111 People & 4 Jewels

  • Thread starter Thread starter alane1994
  • Start date Start date
  • Tags Tags
    Fun Logic Puzzle
alane1994
Messages
36
Reaction score
0
There are 111 people in a competition. The competition has 4 boxes and 4 jewels. Each box is identical and is completely opaque (i.e. you cannot see inside the box once it is closed). The jewels are all different: diamond, ruby, emerald and topaz. Everyone in the competition knows this. The host (who is NOT one of the 111 taking part), places one jewel in each box and then seals the boxes and writes a letter on each box: A, B, C and D - all done WITHOUT any of the 111 competitors watching. The competitors are then asked to guess which jewel is in which box.

-9 people get all 4 of their guesses wrong
-15 people guess exactly one jewel correctly
-25 people guess exactly 2 jewels correctly

How many people:
a) guess exactly 3 jewels correctly
b) guess exactly 4 jewels correctly

Bit of a hey, I'm back... again... puzzle!
 
Mathematics news on Phys.org
If you want a hint, feel free to ask! :)
 
My solution:

Since it is impossible to guess only 3 correctly, that leaves the remaining 62 to have guessed all 4 correctly.
 
MarkFL said:
My solution:

Since it is impossible to guess only 3 correctly, that leaves the remaining 62 to have guessed all 4 correctly.
[sp]Unless one or more people guessed twice of the same jewel, so they would have a slightly higher chance of guessing one of those right. But it[/sp]
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Back
Top