In how many ways can letters in a word CALCULUS be rearranged such that no 2 same letters stand next to each other. I’ve been thinking of Inclusion-Exclusion principle. Is there any different way to solve this task?
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It only takes a minute to sign up.Sign up to join this community