15+2*8-12+42
15+16-12+42
31-12+42
19+42
61
The expected number of cards from the card deck that will be strictly between the two jokers is
.
<h3>What is
card deck?</h3>
The most popular deck of cards used today is a normal 52-card deck of French-suited playing cards. [a] It is the only standard pack[b] used for playing cards in English-speaking nations; but, in many other nations throughout the world, it is used alongside other traditional, frequently older, standard packs with various suit systems, like those with German-, Italian-, Spanish-, or Swiss suits. The English pattern pack is the only one widely accessible in Britain and America and the most popular pattern of French-suited cards globally. The Belgian-Genoese pattern, which was created in France but is also used widely in Spain, Italy, the Ottoman Empire, the Balkans, and much of North Africa and the Middle East, is the second most popular.
Let all pairs of the positions (m,n) of the jokers are equally likely
![P[0]=P[|m-n|=1]=\frac{53}{\left(\begin{array}{c}54 \\2\end{array}\right)}=\frac{2}{27}](https://tex.z-dn.net/?f=P%5B0%5D%3DP%5B%7Cm-n%7C%3D1%5D%3D%5Cfrac%7B53%7D%7B%5Cleft%28%5Cbegin%7Barray%7D%7Bc%7D54%20%5C%5C2%5Cend%7Barray%7D%5Cright%29%7D%3D%5Cfrac%7B2%7D%7B27%7D)
![P[1]=P[|m-n|=2]=\frac{52}{\left(\begin{array}{c}54 \\2\end{array}\right)}=\frac{104}{1431}](https://tex.z-dn.net/?f=P%5B1%5D%3DP%5B%7Cm-n%7C%3D2%5D%3D%5Cfrac%7B52%7D%7B%5Cleft%28%5Cbegin%7Barray%7D%7Bc%7D54%20%5C%5C2%5Cend%7Barray%7D%5Cright%29%7D%3D%5Cfrac%7B104%7D%7B1431%7D)
![P[k]=P|m-n|=k+1=\frac{54-k-1}{\left(\begin{array}{c}54 \\2\end{array}\right)}](https://tex.z-dn.net/?f=P%5Bk%5D%3DP%7Cm-n%7C%3Dk%2B1%3D%5Cfrac%7B54-k-1%7D%7B%5Cleft%28%5Cbegin%7Barray%7D%7Bc%7D54%20%5C%5C2%5Cend%7Barray%7D%5Cright%29%7D)
the expected value will be

Therefore, the expected number of cards that will be strictly between the two jokers is
.
To learn more about card deck from the given link:
brainly.com/question/13477028
#SPJ4
Answer:

Step-by-step explanation:
The base case in the recursive function are:


The recursive case is equal to:

So replace
for
:

In the new expression
is a base case so you don't have to worry for that part, but
is still the recursive case so evaluate again in 

and
are define as base cases so you replace for it's numbers:

Now return to
and replace for the new values:

So the final answer is 20