How many ways can 6 basketball players be listed in order in a program?

There are 720 distinct permutations, or ways in which things can be rearranged. The formula is n!=n * (n-1) * (n-2) * (n-3) * (n-4) * (n-5) * (n-6) or, 6!=6*5*4*3*2*1=720. Therefore, the six basketball players can listed in 720 ways on the program.