Question

How many unique three-letter sequences can be made from the word COMBINATORICS where no 2 letters can be the same?

Answer 1

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 2

720

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