MOG 2017 Q4
Let \(n\) be an odd integer greater than 3 and let \(M = n^2 + 2n - 7\).
Prove that, for all such \(n\), at least four different positive integers (excluding 1 and \(M\)) divide \(M\) exactly.
Mathematical Olympiad for Girls 2017, Question 4. © UK Mathematics Trust. Original paper on ukmt.org.uk
Commentary
This question is about factors of \(M\) so it makes sense to try and factorise the expression. The expression in terms of \(n\) does not factorise, but we have not yet used the fact that \(n\) is odd. Writing \(n = 2k + 1\) gives an expression that can be factorised.
Once you have identified four factors of \(M\) you need to show that they are all different, and that neither of them equal 1.
Since \(n\) is odd and \(n > 3\) we may write \(n = 2k + 1\) where \(k\) is an integer and \(k \ge 2\). Then \(M = 4k^2 + 8k - 4 = 4(k^2 + 2k - 1)\). Even if \(k^2 + 2k - 1\) is prime, we see that \(M\) has the four positive integral divisors 2, 4, \(k^2 + 2k - 1\) and \(2(k^2 + 2k - 1)\), all of them different from 1 and \(M\). Clearly they are all different since (given that \(k \ge 2\)) \(k^2 + 2k - 1 \ge 7\).
Note
When \(k^2 + 2k - 1\) is prime (as happens, for example, when \(k\) is 2 or 4 or 6 or 8), \(M\) has exactly four different factors (excluding 1 and itself). But it can have more than four different factors: for example, when \(k\) is 3, \(M\) is divisible by 2, 4, 7, 8, 14 and 28. These examples show that every algebraic factor of an expression gives a numerical factor, but there may be numerical factors that don’t come from an algebraic factor.
Solution © UK Mathematics Trust, from the MOG 2017 solutions.