Waste less time on Facebook — follow Brilliant.
×

A problem for someone who has \(g_{64}\) free time

How many ways are there to obtain at least one straight flush with 13 cards?

I've been searching for an answer for this curious inquiry, but to no avail. I've also tried solving using inclusion-exclusion, but it has more cases than the number of possible straight flushes. Can someone solve this using some technique, or find an answer using Google? I've tried everything, but to no avail.

An olympiad approach would make an exciting problem. Inclusion-exclusion is veeery very long. Google - I've tried. But maybe you'll have better luck than me?

Clarification: Having a straight flush means having at least five cards with consecutive ranks and the same suit from a standard deck of cards.

Note by Manuel Kahayon
5 months, 2 weeks ago

No vote yet
1 vote

Comments

Sort by:

Top Newest

\(\infty\) Manuel Kahayon · 5 months, 1 week ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...