Combinatorics and Graph Theory · Problem 1.6.3

Fundamentals — David Guichard

Mathematics — Combinatorics · pigeonhole-principle

Problem

Each of 15 red balls and 15 green balls is marked with an integer between 1 and 100 inclusive; no integer appears on more than one ball. The value of a pair of balls is the sum of the numbers on the balls. Show there are at least two pairs, consisting of one red and one green ball, with the same value. Show that this is not necessarily true if there are 13 balls of each color.

Related theory

Browse the problem library