Question

In how many different ways can the letters of the word problem be rearranged to make seven letters word such that no one of letters repeat

Answer 1

Point 1: 'solving' is a 7 letter word.

Point 2: All of it's letters are unique.

Point 3: Words of 7 non repeated letters, mean we have to use all letters in ‘solving’.

There is definitely a formula, but It would be easier if you understand below explanation.

Imagine you have 7 buckets, and 7 kind of fruits. How many ways are there to throw a single fruit in a first bucket?

The answer is 7 since you have 7 different fruit.

PLS mark me as brainlist