Proofs of Universal Statements: Mathematical Induction · Base of Induction

Lesson 5

Nikolai Chukhin · Alexander S. Kulikov

Problem. Find all values of integers \(n \ge 4\) such that a group of \(n\) people cannot be divided into teams, each containing either \(4\) or \(7\) people. Enter the values of \(n\) separated by spaces in increasing order.

5 points