Combinations

7 results

International Mathematical Olympiad 2011 Problem 1

Given any set A={a1,a2,a3,a4}A = \{a_1, a_2, a_3, a_4\} of four distinct positive integers, we denote the sum a1+a2+a3+a4a_1 + a_2 + a_3 + a_4 by sAs_A. Let nAn_A denote the number of pairs (i,j)(i,j) with 1i<j41 \leq i < j \leq 4 for which ai+aja_i + a_j divides sAs_A. Find all sets AA of four distinct positive integers which achieve the largest possible value of nAn_A.

Middle European Mathematical Olympiad 2018 Problem I-4

(a) Prove that for every positive integer mm there exists an integer nmn \geq m such that

n1n2nm=(nm).(*)\left\lfloor \frac {n}{1} \right\rfloor \cdot \left\lfloor \frac {n}{2} \right\rfloor \cdots \left\lfloor \frac {n}{m} \right\rfloor = \binom {n} {m}. \tag{*}

(b) Denote by p(m)p(m) the smallest integer nmn \geq m such that the equation (*) holds. Prove that p(2018)=p(2019)p(2018) = p(2019).

Remark: For a real number xx, we denote by x\lfloor x \rfloor the largest integer not larger than xx.