Problem #PRU-107802

Problems Methods Examples and counterexamples. Constructive proofs Algebra and arithmetic Word problems Tables and tournaments Number tables and its properties Pigeonhole principle Pigeonhole principle (other)

Problem

  • Eight schoolchildren solved \(8\) tasks. It turned out that \(5\) schoolchildren solved each problem. Prove that there are two schoolchildren, who solved every problem at least once.

  • If each problem is solved by \(4\) pupils, prove that it is not necessary to have two schoolchildren who would solve each problem.