I understand everything apart from 1 aspect: The numbers multiplying the combinations. I assume these are the possibilities that the remaining cards do not have any matches, but how can I calculates these numbers without writing out all the combinations. Thanks
2026-03-25 19:05:40.1774465540
Probability of matching set of cards
83 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in PROBABILITY
- How to prove $\lim_{n \rightarrow\infty} e^{-n}\sum_{k=0}^{n}\frac{n^k}{k!} = \frac{1}{2}$?
- Is this a commonly known paradox?
- What's $P(A_1\cap A_2\cap A_3\cap A_4) $?
- Prove or disprove the following inequality
- Another application of the Central Limit Theorem
- Given is $2$ dimensional random variable $(X,Y)$ with table. Determine the correlation between $X$ and $Y$
- A random point $(a,b)$ is uniformly distributed in a unit square $K=[(u,v):0<u<1,0<v<1]$
- proving Kochen-Stone lemma...
- Solution Check. (Probability)
- Interpreting stationary distribution $P_{\infty}(X,V)$ of a random process
Related Questions in COMBINATORICS
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Hard combinatorial identity: $\sum_{l=0}^p(-1)^l\binom{2l}{l}\binom{k}{p-l}\binom{2k+2l-2p}{k+l-p}^{-1}=4^p\binom{k-1}{p}\binom{2k}{k}^{-1}$
- Algebraic step including finite sum and binomial coefficient
- nth letter of lexicographically ordered substrings
- Count of possible money splits
- Covering vector space over finite field by subspaces
- A certain partition of 28
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
Related Questions in STATISTICS
- Given is $2$ dimensional random variable $(X,Y)$ with table. Determine the correlation between $X$ and $Y$
- Statistics based on empirical distribution
- Given $U,V \sim R(0,1)$. Determine covariance between $X = UV$ and $V$
- Fisher information of sufficient statistic
- Solving Equation with Euler's Number
- derive the expectation of exponential function $e^{-\left\Vert \mathbf{x} - V\mathbf{x}+\mathbf{a}\right\Vert^2}$ or its upper bound
- Determine the marginal distributions of $(T_1, T_2)$
- KL divergence between two multivariate Bernoulli distribution
- Given random variables $(T_1,T_2)$. Show that $T_1$ and $T_2$ are independent and exponentially distributed if..
- Probability of tossing marbles,covariance
Related Questions in CARD-GAMES
- optimal strategy for drawing a deck of cards
- Blackjack basic strategy statistics wanted
- Combinatorics question: Suppose you play a game of cards in which only 5 cards are dealt from a standard 52 deck....
- Three of a kind and a pair on hands bigger than 5
- Card Game Odds In-Between
- Inversions of a Deck of Cards
- 2 detectives card trick
- Interesting Riddle about a Game with Playing Cards
- Does not playing the basic strategy in Blackjack hurt other players at the table?
- Why is this line of reasoning not correct?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
For part (a), you can describe this very simply using derangements. The probability that Sophie wins is the probability that Ella's arrangement of her cards is a derangement with respect to Sophie's arrangement. In this case, $\dfrac{!5}{5!}=\dfrac{44}{120}=\dfrac{11}{30}$, no brute force listing of arrangements required.
As for how to calculate $!5=44$, the linked wikipedia article has plenty of information on this. Your pictured solution went through the trouble of finding exactly one match, exactly two matches, etc... which is tedious and has strong chance of making a mistake. Further, it glosses over how to have found the $9,2,1,0,1$ that appear in the products which leads exactly to your question here. These numbers happen to be $!4, !3, !2, !1,$ and $!0$ respectively, but the solution makes no mention how these were found and one can only guess that the author of the solution found them by brute force (which isn't so bad for $!3, !2, !1, !0$ but for $!4$ this really should have been explained in greater detail)
A better way to do this directly with little to no knowledge of derangements would have been with inclusion-exclusion over the events where the first card matched, the second card matched, etc... At least one card matching would have been given by $\sum\limits_{k=1}^5 \left(-1\right)^{k+1}\binom{5}{k}(5-k)!$ which amounts to $120-60+20-5+1=76$ and subtracting this away from $120$ to give the number of arrangements with no matches would have been $120-76=44$, as found before. This inclusion-exclusion argument leads to one of the common methods to calculate the number of derangements which is outlined further in the linked wikipedia article. There are faster ways to do this which require a bit more theory to understand, also outlined in the article.
Now, as for part (b), the only thing to recognize is that this will follow a binomial distribution and you can use the well known results for that.