How Much Information Can Nods and Shakes Convey in a Bridge Game?

szpengchao
Messages
2
Reaction score
0
consider a pack of 52 cards in a bridge game. a player try to convey 13 cards by nods of head or shake of heads to his partner. find the shannon entropy
 
Mathematics news on Phys.org
You need \rm{log}_{2}52 \approx 6 bits/card to specify a single card (admitting that they are all equiprobable). For 13 independent cards, you'll need 13\times\rm{log}_{2}52 bits.
 
JSuarez said:
You need \rm{log}_{2}52 \approx 6 bits/card to specify a single card (admitting that they are all equiprobable). For 13 independent cards, you'll need 13\times\rm{log}_{2}52 bits.

but the question tells the answer is 40, and it asks to find a coding function with entropy 50
 
Well, then the question is asking for the amount of information necessary to transmit an arrangement of 13 cards as a whole and not individually; that was not clear from the question.

There are \binom{52}{13} possible arrangements, and this gives an entropy of -\rm{log_2}\binom{52}{13} \approx 39.21 bits.
 
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.
Back
Top