Answer:
35280ways
Step-by-step explanation:
let X be the number of ways the letters can be arranged with no restriction,
let M be the number of ways they can be arranged if the letters C and O must stand together,
and let the number of ways the letters C and O can be arranged if they can not stand together.
X=8!
M= 7!
N=X–M=8!–7!=35280 ways
Answer:
300000 × 300000
Step-by-step explanation:
You add zeros to the number without the exponent (in this case '3') based on the exponent number (in this case '5').
Answer:
3, 6, 9, 12, 15, 18, 21, 24, 27, 30, 33, 36.
Step-by-step explanation:
Let r be the number of cards Ron has.
r + 2r + 4 = 97
3r + 4 = 97
3r + 4 - 4 = 97 - 4
3r = 93
3/3r = 93/3
r = 31
Ron has a total of 31 cards and Jason has a total of 66 cards.
Answer:
212
Step-by-step explanation:
<u>Rule</u>
- Subtract the 2nd number from the first to obtain the first digit(s) of the answer.
- Add the 2nd number to the 1st to obtain the last digit(s) of the answer.
5 - 3 = 2
5 + 3 = 8
Therefore: 28
9 - 1 = 8
9 + 1 = 10
Therefore: 810
8 - 7 = 1
8 + 7 = 15
Therefore: 115
6 - 2 = 4
6 + 2 = 8
Therefore: 48
7 - 5 = 2
7 + 5 = 12
Therefore: 212
