Maths Olympiad Prep

Library / /508 of 841

Number theory Difficulty 5.2 AIME, harder Find the answer

Does there exist an irrational number α>1\alpha>1 such that αn0(mod2017)\left\lfloor\alpha^{n}\right\rfloor \equiv 0 \quad(\bmod 2017) for all integers n1n \geq 1 ?

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

Yes. Let α>1\alpha>1 and 0<β<10<\beta<1 be the roots of x24035x+2017x^{2}-4035 x+2017. Then note that αn=αn+βn1\left\lfloor\alpha^{n}\right\rfloor=\alpha^{n}+\beta^{n}-1. Let xn=αn+βnx_{n}=\alpha^{n}+\beta^{n} for all nonnegative integers nn. It's easy to verify that xn=4035xn12017xn2xn1x_{n}=4035 x_{n-1}-2017 x_{n-2} \equiv x_{n-1} (mod2017)(\bmod 2017) so since x1=40351(mod2017)x_{1}=4035 \equiv 1(\bmod 2017) we have that xn1(mod2017)x_{n} \equiv 1(\bmod 2017) for all nn. Thus α\alpha satisfies the problem.

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: Omni-MATH, licensed Apache-2.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.