As you wish to know more specifically what this is for Mr. pbuk (and others may also wish to know), it is for a game I'm designing that combines Chess, Poker, and Go. I call it Chepogo. But in order for this game to work, I have to come up with a ranked list of what one might call "hyper-Poker"...
Firstly: this is not a homework assignment.
I don't see a problem with my method of calculating the # of Straight Flushes. Though I humbly admit that I may not be seeing a problem that's actually there.
Calculating the # of Straight Flushes in a standard (1) Poker deck is easy enough: ##...
So here's the basic situation:
1. I have combined two Poker decks, with a total of 104 cards
2. There's no limit to the size of the hand (using Poker-style hands). Thus for example one could have a Straight that is of 6,7, or more cards in a sequence.
3. There's "wraparound", as in: a Straight...