Assume that you have an ordinary deck of 52 playing cards. how many possible 7-card poker hands are there that contain exactly one ace and one king?

Let's deal with the restrictions first.
To get one ace, we have 4 total aces, and we want to choose one ace:


We can repeat this for the king, as well.


Now, let's deal with the remaining five cards.
Since we can't deal a king or an ace anymore, let's subtract 8 from a pack of 52. This ensures that we don't pick a king or an ace anymore.

Now, we simply need to pick five cards from a pack of 44 cards:


Thus, the total number of ways to pick exactly one ace and one king is:


The calculator should do the rest.

1. isolate the variable, in this case, d. subtract 35.5 on both sides of the equation.2. 52 subtracted by 35.5 is 16.53. therefore your answer would be d= 16.5this is the basics of pre algebra, isolating variable through adding, subtracting, multiplying, and dividing, if you have any other questions to ask just comment!

There was 504 pages in that chunk