Solved: A circular disk is cut into n distinct sectors,
Chapter 9, Problem 9.131(choose chapter or problem)
A circular disk is cut into n distinct sectors, each shaped like a piece of pie and all meeting at the center point of the disk. Each sector is to be painted red, green, yellow, or blue in such a way that no two adjacent sectors are painted the same color. Let Sn be the number of ways to paint the disk. Find a recurrence relation for Sk in terms of Sk1 and Sk2 for each integer k 4.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer