how many words , with or without meaning , can be formed using all letters of the word red using each letter exactly once ?
the word red has exactly 3 letters which are all different . therefore the number of words that can be formed = number of permutations of 3 letters taken all at a time . = p ( 3 , 3 ) = 3 ! = 3 x 2 × 1 = 6 answer : a
factorial(const_3)