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
Im sorry but is there more to the question
Answer:
A
Step-by-step explanation:
Answer:
B, I think that's the answer
35% of 100 is 35. have a great day!