How many different ways can you choose 5 cards from a shuffled deck and get exactly three aces? the order of cards doesn’t matter-only which particular 5 cards matters.

The total number of ways to select 5 cards from a deck of 52 cards of which 3 are aces are 4512

Step-by-step explanation:

The formula to find no of ways to select is

There are in all 52 cards in a deck of which 4 are aces. So 48 cards are non ace cards.

Here

We have to select 5 cards of which 3 must be aces.

there are in all 4 aces.

To select three aces from four aces we get

Now we have selected three aces.

We are left to select 2 cards from the rest of the 48 cards

We get

hence the total number of ways to select 5 cards from a deck of 52 cards of which 3 are aces are = 1128 (4) = 4512

answer: b. f(x) = (x + 2)^3 (x^2 - 7x + 3)^4

step-by-step explanation:

polynomials always have as many roots as their order. this is a 4th order polynomial- hence 4 roots!

complex roots of polynomials always come in pairs. the quadratic equation has the "+/-" in that will alwaysgenerate m+ni amd m-ni, so 7-2i must be a root of this polynomial equation.

the order of the numerator and denominator are both 2. so the horizontal asymptote is y=a2/b2 =7

verticle asymptotes are the forbidden x-values. f(x) becomes undefined at x=-3 because this value will cause a zero denominator.

a graph of r(x) will have vertical asymptotes at ±1 because these values will make the denominator zero. so the domain of the function cannot include ±1.

you 're wlecome! : )

cretdit to source