Calculating the number of possibilities from drawing 5 from a stack of cards. A standard deck of cards contains 52 cards.
Each deck of cards consists of 4 different types of cards (diamond, heart, spade, clover). Each type has 13 different ranks (ace, 2, 3, 4, 5, 6, 7, 8, 9, 10, jack, queen, king)

Let's say I draw 5 cards from a single deck, how possible sets of 5 cards could I draw that contain exactly two cards of the same rank?

infinitely many solutions

step-by-step explanation:

we have been given the equation;

2(2x + 3) = -4 + 2(2x + 5)

we need to determine the value of x.

2(2x + 3), we expand this expression to obtain 4x + 6

similarly 2(2x + 5) will become 4x + 10

now we have;

4x + 6 = -4 + 4x + 10

4x + 6 = 4x + 10 - 4

4x + 6 = 4x + 6

the expression on the left hand side is identical to the one on the right hand side. therefore, we are looking at just a single straight line whose equation is;

y = 4x + 6

consequently, we shall have infinitely many solutions

i would you but i don't under stand the qustion

step-by-step explanation: