Browse · MathNet
PrintFirst round – City competition
Croatia number theory
Problem
Determine positive integer such that the sum of his two smallest divisors is and the sum of his two largest divisors is .
Solution
1.1. Let us denote by the number of coins that the knights sitting in chairs 1, 2, ..., 10 had in the beginning, respectively. We have to determine . We have a system of equations: . By combining those equations we get From the last equation it follows that , so the knight that ended up with 36 coins had 46 coins in the beginning.
Final answer
935
Techniques
Factorization techniques