Maths Olympiad Prep

Library / /4 of 22

Algebra Difficulty 4.7 AIME Prove it Romania

What is the smallest value that the sum of the digits of the number 3n2+n+13n^2 + n + 1, nNn \in \mathbb{N}, can take?

Solution

For n=8n = 8 we have 3n2+n+1=2013n^2 + n + 1 = 201 whose sum of the digits is 33.

We prove that the sum of the digits of 3n2+n+13n^2+n+1 cannot be 11 or 22. As 3n2+n+13n^2+n+1 is odd, it cannot be written as 10k10^k or 210k2 \cdot 10^k, kNk \in \mathbb{N}, nor can it be written as 10k+10j10^k+10^j with k,j>0k, j > 0. If 3n2+n+1=10k+13n^2+n+1 = 10^k+1, then n(3n+1)=10kn(3n+1) = 10^k. But nn and 3n+13n+1 are co-prime, hence they must be 2k2^k and 5k5^k. As n<3n+1n < 3n+1, we must have n=2kn = 2^k and 3n+1=5k3n+1 = 5^k, which is not possible because 5k>4k>32k+15^k > 4^k > 3 \cdot 2^k + 1 if k2k \ge 2, and k=1k=1 does not work either.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.