Number theoryDifficulty 6.1National olympiadProve it
6. Let a⩾2 be a given positive integer. Prove: (i) For any positive integer n, there must be n<an; (ii) For any positive integer n, there must be a unique integer k⩾0, such that ak⩽n<ak+1.
Solution
6. (i) Prove by mathematical induction; (ii) Consider the set T={k:ak⩽n,k∈Z}, and apply the conclusion from question 5 to T.
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: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.