Category Archives: problem

2022-24 Hey, who turned out the lights?

There are light bulbs \(\ell_1,\dots, \ell_n\) controlled by the switches \(s_1, \dots, s_n\). The \(i\)th switch flips the status of the \(i\)th light and possibly others as well. If \(s_i\) flips the status of \(\ell_j\), then \(s_j\) flips the status of \(\ell_i\). All lights are initially off. Prove that it is possible to turn all the lights on.

2022-21 A determinant of greatest common divisors

Let \(\varphi(x)\) be the Euler’s totient function. Let \(S = \{a_1,\dots, a_n\}\) be a set of positive integers such that for any \(a_i\), all of its positive divisors are also in \(S\). Let \(A\) be the matrix with entries \(A_{i,j} = gcd(a_i,a_j)\) being the greatest common divisors of \(a_i\) and \(a_j\). Prove that \(\det(A) = \prod_{i=1}^{n} \varphi(a_i)\).

2022-20 4 by 4 symmetric integral matrices 

Let \(S\) be the set of all 4 by 4 integral positive-definite symmetric unimodular matrices. Define an equivalence relation \( \sim \) on \(S\) such that for any \( A,B \in S\), we have \(A \sim B\) if and only if \(PAP^\top = B\) for some integral unimodular matrix \(P\). Determine \(S ~/\sim \).