Mathematical and Physical Journal
for High Schools
Issued by the MATFUND Foundation
Already signed up?
New to KöMaL?
I want the old design back!!! :-)

Problem A. 399. (April 2006)

A. 399. Given n 3-element subset of a certain set S. Prove that if n=6 then the elements of S can be colored with two colors such that each subset contains both colors. Is the same true for n=7?

(5 pont)

Deadline expired on May 18, 2006.


Statistics:

9 students sent a solution.
5 points:Blázsik Zoltán, Erdélyi Márton, Estélyi István, Hujter Bálint, Jankó Zsuzsanna, Kisfaludi-Bak Sándor, Nagy 224 Csaba, Paulin Roland, Tomon István.

Problems in Mathematics of KöMaL, April 2006