About this document

Double Counting in Combinatorics by sharad dsouza is a document available to read on EtoBox.

The document summarizes problems from the Hong Kong Team Selection Test 2 for the 2009 International Mathematical Olympiad. It includes two problems: Problem 1 asks to find a formula for a function f(x) where f(x+y)=f(x)+f(y)+axy(x+y)+bxy+c(x+y)+4, and finds the greatest value of m such that f(x)≥mx2+(5m+1)x+4m. Problem 2 defines a k-clique as a set of k people who all know each other, and asks to prove that for a party with multiple 3-cliques but no 5-clique, there

Author

sharad dsouza

Language

EN