Let p be a prime number, and let x > 1 be any positive integer. Consider a wheel with p spokes shown in Figure 4.2.
(a) We have paints of x different colors. How many ways are there to color the spokes if we want to use at least two colors?
(b) How many ways are there to do the same if we do not consider two paint jobs different if one can be obtained from the other by rotation?
(c) What theorem of number theory does this prove?