Practice library
Problems
1An operation \(\diamond\) on the set \(G = \{1, 2, 3, \dots, 2016\}\) is given by the table \[ \begin{array}{c|cccccc} \diamond & 1 & 2 & 3 & 4 & \cdots & 2016 \\ \hline 1 & 5 & 5 & 5 & 5 & \cdots & 5 \\ 2 & 1 & 2 & 5 & 5 & \cdots & 5 \\ 3 & 4 & 3 & 5 & 5 & \cdots & 5 \\ 4 & 5 & 5 & 5 & 5 & \cdots & 5 \\ \vdots & \vdots & \vdots & \vdots & \vdots & \ddots & \vdots \\ 2016 & 5 & 5 & 5 & 5 & \cdots & 5 \end{array} \] …Open2Let \(k\) be a positive integer and let \(A\), \(B\), \(C\) be sets such that \(|A \triangle B| = |B \triangle C| = |C \triangle A| = 2k .\) Prove that there is exactly one set \(D\) for which \(|A \triangle D| = |B \triangle D| = |C \triangle D| = k .\) …
Showing 2 of 651 - problem statements are free for everyone.