You need to enable JavaScript to run this app.
优惠活动
大模型
产品
解决方案
定价
更多

标准扑克牌无放回抽9张:至少2种花色各≥3张的概率求解

Alright, let's break this down step by step. First, let's align on the problem's requirement: we need the probability that drawing 9 cards without replacement from a standard 52-card deck results in at least 2 suits each having 3 or more cards (your note clarifies distributions like 3,3,3,0 and 4,3,1,1 count, while 5,2,1,1 doesn't because only one suit meets the 3+ threshold).

Solution Approach: Calculate Valid Combinations, Then Divide by Total Combinations

First, the total number of possible 9-card hands is the combination of 52 cards taken 9 at a time:
C(52,9) = 3679075400

Next, we'll enumerate all valid suit-card count distributions, calculate the combinations for each, then sum them up to get the total valid hands.

Valid Distributions & Their Calculations

1. 3,3,3,0 (3 suits with 3 cards each, 1 suit with 0)

This is three suits contributing exactly 3 cards each, with no cards from the fourth suit:

  • Choose which 3 suits to use: C(4,3) = 4 ways
  • For each chosen suit, pick 3 cards: C(13,3) = 286 per suit, so 286³ total for three suits
  • Total combinations for this case: 4 × 286³ = 93574624

2. 4,3,1,1 (1 suit with 4 cards, 1 suit with 3, 2 suits with 1 each)

Two suits meet the 3+ threshold, with the other two suits contributing 1 card each:

  • Choose the suit for 4 cards: C(4,1) = 4; choose the suit for 3 cards from the remaining 3: C(3,1) = 3 → total 12 suit combinations
  • Pick 4 cards from the first suit: C(13,4) = 715
  • Pick 3 cards from the second suit: C(13,3) = 286
  • Pick 1 card from each of the remaining two suits: C(13,1) × C(13,1) = 13 × 13 = 169
  • Total combinations for this case: 12 × 715 × 286 × 169 = 414705720

3. 4,4,1,0 (2 suits with 4 cards each, 1 suit with 1, 1 suit with 0)

You didn't mention this distribution, but it's valid (two suits meet the 3+ threshold):

  • Choose which 2 suits to use for 4 cards each: C(4,2) = 6 ways
  • Pick 4 cards from each chosen suit: C(13,4)² = 715² = 511225
  • Choose the suit for the single card from the remaining 2: C(2,1) = 2, then pick 1 card: C(13,1) = 13 → total 26 ways
  • Total combinations for this case: 6 × 511225 × 26 = 79751100

4. 5,3,1,0 (1 suit with 5 cards, 1 suit with 3, 1 suit with 1, 1 suit with 0)

Another valid distribution (two suits meet the 3+ threshold):

  • Choose the suit for 5 cards: C(4,1) = 4; choose the suit for 3 cards: C(3,1) = 3; choose the suit for 1 card: C(2,1) = 2 → total 24 suit combinations
  • Pick 5 cards from the first suit: C(13,5) = 1287
  • Pick 3 cards from the second suit: 286
  • Pick 1 card from the third suit: 13
  • Total combinations for this case: 24 × 1287 × 286 × 13 = 114841584

5. 6,3,0,0 (1 suit with 6 cards, 1 suit with 3, 2 suits with 0)

Valid (two suits meet the 3+ threshold):

  • Choose the suit for 6 cards: C(4,1) = 4; choose the suit for 3 cards: C(3,1) = 3 → total 12 suit combinations
  • Pick 6 cards from the first suit: C(13,6) = 1716
  • Pick 3 cards from the second suit: 286
  • Total combinations for this case: 12 × 1716 × 286 = 5889312

Final Probability Calculation

Sum all valid combinations:
93574624 + 414705720 + 79751100 + 114841584 + 5889312 = 708762340

Divide by the total number of hands to get the probability:
708762340 / 3679075400 ≈ 0.1926 (or roughly 19.3%)

Key Notes

  • Always enumerate all valid distributions—missing cases like 4,4,1,0 will lead to an incorrect, lower probability
  • Be careful when counting suit selections: distinguish between suits with different card counts (e.g., which suit has 4 cards vs. which has 3) to avoid overcounting or undercounting
  • Double-check combination calculations (each suit has exactly 13 cards, so all per-suit counts use C(13, k) where k is the number of cards drawn from that suit)

内容的提问来源于stack exchange,提问作者Sally

相关产品推荐
方舟 Agent Plan

超全模态模型 × Harness 升级,最新支持 Deepseek-V4.1-Flash、GLM-5.3 系列、Doubao-Seedream-5.0-pro、Kimi-K3 (部分), 限时 9.9 元起

最近更新时间:2026.05.19 03:26:44