Let $N = 15! = 15\cdot 14\cdot 13 ... 3\cdot 2\cdot 1$. Prove that $N$ can be written as a product of nine different integers all between $16$ and $30$ inclusive.
Problem
Source: 2021 Irish Mathematical Olympiad P1
Tags: number theory, factorial
30.05.2021 21:07
Just keep testing (splitting factors and such) until something works
27.07.2021 23:42
Solution. We note that the prime factorisation of $15!$ is $$ 15! = 2^{11} \cdot 3^6 \cdot 5^3 \cdot 7^2 \cdot 11 \cdot 13. $$With this, we claim that $15!$ is the product of the nine distinct integers $16, 18, 20, 21, 22, 25, 26, 27, 28$. Indeed, we can find the prime factorisation of their product which is \begin{align*} &16\cdot 18\cdot 20\cdot 21\cdot 22\cdot 25\cdot 26\cdot 27\cdot 28 \\ =\ &(2^4) \cdot (2 \cdot 3^2) \cdot (2^2 \cdot 5) \cdot (3 \cdot 7) \cdot (2 \cdot 11) \cdot (5^2) \cdot (2 \cdot 13) \cdot (3^3) \cdot (2^2 \cdot 7) \\ =\ &2^{11} \cdot 3^6 \cdot 5^3 \cdot 7^2 \cdot 11 \cdot 13 \\ =\ &15!. \end{align*}
28.07.2021 00:06