Proof WritingChallengeProblem-Solving Strategies
Problem-Solving Strategies · Challenge problem
Seven friends sit in a circle, each friends with exactly the two neighbours. They are split into two rooms, and while someone has BOTH neighbours in their own room, that person switches rooms. When the moving stops, what is the largest possible number of friendships inside rooms?