Answer:
The number of different possible poker hands is found by counting the number of ways that 5 cards can be selected from 52 cards, where the order is not important. It is a combination, so we use c n r
Step-by-step explanation:
The possible number of the poker hands is probably . C 52 5= 52!/5!x47!= 2598960
Answer:
x = 3
Step-by-step explanation:
reverse foil the denominator and find the largest solution.
x-3(x+1)
3 is the largest solution
Answer:
360 cm
Step-by-step explanation:
volume= length x width x height
8*5*9=360 cm
Answer:
( l+w)
Step-by-step explanation:
just did the question
Our matrix C is the encoder. Let X be our secret message and let B be our encoded message. Therefore the relationship between the 3 can be represented as:
CX = B
So we want to solve for X (our secret message). So using matrix algebra:
X = C^-1*B
where C^-1 is the inverse of C.
C^-1 = | 3 -2 |
|4 -3 |
So we take C^-1 and multiply it by matrix B to get X. Matrix B is already given to us. So just multiply those two. I used a calculator to get:
X = | 20 8 5 3 15 12 15 |
| 18 9 19 2 12 21 5 |
And since A = 1, B = 2, C = 3, etc....
We decode our message and it says:
X = | T H E C O L O |
| R I S B L U E |
So the answer is: The color is blue (D)
