MathDB
JBMO 2012 Problem 3

Source: JBMO 2012

June 27, 2012
ceiling functionmodular arithmeticcombinatorics proposedcombinatorics

Problem Statement

On a board there are nn nails, each two connected by a rope. Each rope is colored in one of nn given distinct colors. For each three distinct colors, there exist three nails connected with ropes of these three colors. a) Can nn be 66 ? b) Can nn be 77 ?
Back to ProblemsView on AoPS