Problem #PRU-100581

Problems Combinatorics

Problem

We have a set of \(7\) letters: A, T, E, W, L, O and R. We are interested in the \(4\) letter “words” that you can build from these letters, using each one only once. How many such “words” are there? What if we only want to build “words” such that the letters used are in the alphabetical order, how many “words” can we make then?