A circular, rotating serving tray has 8 different desserts placed around its circumference. How many different ways can all of the desserts be arranged on the circular tray?

In order to solve for the ways the desserts can be arranged in the circular tray, we make use of the expression,

(n - 1)!

where n is the number of desserts. In this problem, there are 8 desserts. 7! equals 5040. Therefore, there are 5040 ways to arrange the desserts in the circular tray.