4
Part of 2010 Korea National Olympiad
Problems(2)
Considering a simple graph with special conditions
Source: Korea National Olympiad 2010 Problem 4
9/9/2012
There are people and some people shaked hands each other. Two people can shake hands at most 1 time. For arbitrary four people such that shaked hands, then one of shaked hand each other. Prove the following statements.
(a) Prove that people can be divided into two groups, , such that for all where and , and shaked hands or and didn't shake hands.
(b) There exist two people such that the set of people who are not and that shaked hands with is same wiith the set of people who are not and that shaked hands with .
inductiongraph theorycombinatorics proposedcombinatorics
The remainder of 1+2+...+k
Source: Korea National Olympiad 2010 Problem 8
9/9/2012
There are people sitting around a round table. First, we give one person a candy. Next, we give candies to st person, th person, th person, , and th person clockwise from . Find the number of people who get at least one candy.
modular arithmeticnumber theory proposednumber theory