Answer:
Permutation is used.
No. of arrangements = 1260
Step-by-step explanation:
Permutation is used for choosing & arrangement of 'r' out of 'n' objects, when sequence is important.
Total no. of alphabets in CORRECT = 7
C is repeated twice, R is repeated twice
So, Total No. of arrangements = <u>7 !</u>
(2!)(2!)
= 5040 / 4
= 1260
Answer: X= -7
Step-by-step explanation: A negative time a negative is a positive so -12x-7 is equal to 84. 84 plus 16 is equal too 100.
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:
B.3.2
Step-by-step explanation:
Answer:
x = 6/11
Step-by-step explanation:
−23(3x−4)+3x=56
Distribute
-69x + 92 +3x = 56
Combine like terms
-66x+92 = 56
Subtract 92 from each side
-66x+92-92 = 56-92
-66x =-36
Divide each side by -66
-66x/-66 = -36/-66
x = 6/11
