This is Discrete Structures.

1. Prove by induction that there are (n 1)! ways to seat n people around a circular table, if two seatings are considered the same when everybody has the same neighbor on their right and on their left.

2. How many such seatings are if two seatings are considered the same when everybody has the same neighbors, regardless of which side they're on?