Javier is going to Disneyland during spring break. He plans on visiting four particular attractions all before lunch. In how many orders could he visit all four attractions once?
I need to count the number of permutations of four attractions, since the order matters. I know that the formula for the number of permutations of n objects is n!, which means n times (n-1) times (n-2) and so on down to 1. So, in this case, the number of permutations of four attractions is 4!, which is 4 times 3 times 2 times 1, which is 24. Therefore, Javier could visit all four attractions in 24 different orders. 