Quote:
Originally Posted by chandan.mnnit
One question from my side -
At the farewell party of a certain class, having n students, each student of the class gave a gift to exactly k other students of the class. What is the least possible number of students in the class who recieved at least one gift?
|
okay here's an easy explanation
let n=3
and k=1
let those three students be a,b and c
a gives one gift to b
b gives one gift to a.
c gives one gift to a.
(drawing a small diagram would be helpful)
a and b are the only students who got gifts in this case, ie keeping in mind that we have to find out "the least possible number of students in the class who recieved at least one gift"
no of students who got the gift = 2 = 1+1= k+1.
this works with any number of students and any number of gifts.