We've looked at solving recurrences for both the Josephus problem as originally developed in the book along with a penultimate Josephus problem on a homework assignment. We can keep on going with this. For n > 3, define Tn to be the number label of the third remaining person in a Josephus scenario. Derive a recurrence for Tn and solve this recurrence for a closed form. Prove your answer is correct with an induction argument. Bonus: (5 pts + glory) For n > d > 0 we let Dn be the number label of the dth remaining person in a Josephus situation. Find a closed form for Dn. We've looked at solving recurrences for both the Josephus problem as originally developed in the book along with a penultimate Josephus problem on a homework assignment. We can keep on going with this. For n > 3, define Tn to be the number label of the third remaining person in a Josephus scenario. Derive a recurrence for Tn and solve this recurrence for a closed form. Prove your answer is correct with an induction argument. Bonus: (5 pts + glory) For n > d > 0 we let Dn be the number label of the dth remaining person in a Josephus situation. Find a closed form for Dn