k≥1 is a real number such that if m is a multiple of n, then [mk] is a multiple of [nk]. Show that k is an integer.
Solution
Solution:
Suppose k is not an integer. Take an integer n such that nk>1, but nk is not an integer. Now take a positive integer c such that c+11≤nk−[nk]<c1. Then 1≤(c+1)nk−(c+1)[nk]<1+c1. Hence [(c+1)nk]=(c+1)[nk]+1. Put m=(c+1)n. Then m is a multiple of n. But if [mk] is a multiple of [nk], then [mk]−(c+1)[nk]=1 is a multiple of [nk], which is impossible since nk>1. So we have a contradiction. So k 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.