exercise:7d6c0faf71: Difference between revisions

From Stochiki
No edit summary
No edit summary
 
Line 1: Line 1:
<div class="d-none"><math>
The following problem is called the ''two aces problem''. This problem, dating back to 1936, has been attributed to the English mathematician J. H. C.
\newcommand{\NA}{{\rm NA}}
\newcommand{\mat}[1]{{\bf#1}}
\newcommand{\exref}[1]{\ref{##1}}
\newcommand{\secstoprocess}{\all}
\newcommand{\NA}{{\rm NA}}
\newcommand{\mathds}{\mathbb}</math></div>
The following problem is called the ''two aces problem''. This problem,
dating back to 1936, has been attributed to the English mathematician J. H. C.
Whitehead (see Gridgeman<ref group="Notes" >N. T.  
Whitehead (see Gridgeman<ref group="Notes" >N. T.  
Gridgeman, Letter, ''American Statistician'', 21 (1967), pgs. 38-39.</ref>). This problem was also
Gridgeman, Letter, ''American Statistician'', 21 (1967), pgs. 38-39.</ref>). This problem was also

Latest revision as of 01:03, 14 June 2024

The following problem is called the two aces problem. This problem, dating back to 1936, has been attributed to the English mathematician J. H. C. Whitehead (see Gridgeman[Notes 1]). This problem was also submitted to Marilyn vos Savant by the master of mathematical puzzles Martin Gardner, who remarks that it is one of his favorites.

A bridge hand has been dealt, i.e. thirteen cards are dealt to each player. Given that your partner has at least one ace, what is the probability that he has at least two aces? Given that your partner has the ace of hearts, what is the probability that he has at least two aces? Answer these questions for a version of bridge in which there are eight cards, namely four aces and four kings, and each player is dealt two cards. (The reader may wish to solve the problem with a 52-card deck.)

Notes

  1. N. T. Gridgeman, Letter, American Statistician, 21 (1967), pgs. 38-39.