Maths Olympiad Prep

Library / /2 of 61

Algebra Difficulty 4.9 AIME Prove it Ibero-American Mathematical Olympiad

Problem:

k1k \geq 1 is a real number such that if mm is a multiple of nn, then [mk][mk] is a multiple of [nk][nk]. Show that kk is an integer.

Solution

Solution:

Suppose kk is not an integer. Take an integer nn such that nk>1nk > 1, but nknk is not an integer. Now take a positive integer cc such that 1c+1nk[nk]<1c\frac{1}{c+1} \leq nk - [nk] < \frac{1}{c}. Then 1(c+1)nk(c+1)[nk]<1+1c1 \leq (c+1)nk - (c+1)[nk] < 1 + \frac{1}{c}. Hence [(c+1)nk]=(c+1)[nk]+1[(c+1) n k] = (c+1)[n k] + 1. Put m=(c+1)nm = (c+1) n. Then mm is a multiple of nn. But if [mk][mk] is a multiple of [nk][nk], then [mk](c+1)[nk]=1[mk] - (c+1)[nk] = 1 is a multiple of [nk][nk], which is impossible since nk>1nk > 1. So we have a contradiction. So kk must be an integer.

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.