How many unique three-letter sequences can be made from the word COMBINATORICS where no 2 letters can be the same?
2 answers:
Answer:
BIN
TIC
SIT
BIT
MOB
ROT
SIR
BAN
BAM
TAN
RAT
ROB
theres tons of words you can make, just take a few seconds and find as many as you can
Answer:
720
Step-by-step explanation:
the way I read this problem is like a Scrabble set. Start by getting a unique set of letters:
COMBINATRS
10 unique letters
10! / (10-3)!
10! / 7!
720
You might be interested in
Answer:
use identity (a - b) ^3 = a^3 - b^3 - 3ab (a - b)
here, a = x ^2
b = -1
= (x^2)^3 - (-1)^3 - 3 * x ^2 * -1 ( x^2 - (-1) )
x^6+ 3 x^2 ( x ^2 + 1)
I think this is the answer
Y=0
Because y= 0 would be the x-axis just like x=0 would be the y axis
I know that’s a bit confusing but hope it helps
The least common denominator would be:
D. 30
<em>LCD(3/5, 1/6) = LCM(5, 6) = 2×3×5 = 30 </em>
Answer
170 in
Explanation
If each of the lengths represent one side then the perimeter is the sum of all sides so you simply add them all up and get 170
4x^2 + 5x - 8 + (- 4x^2 - 5x + 8) = 0
all ur doing is changing the signs so they will cancel each other out.
so ur adding : -4x^2 - 5x + 8
