For a positive integer k, let ak=⌊k2k⌋. Prove that the sequence (ak) contains infinitely many odd numbers.
(⌊x⌋ denotes the largest integer not greater than x.)
Solution
Let k=3⋅4l for an arbitrary positive integer l. Then we have ak=⌊k2k⌋=⌊3⋅4l23⋅4l⌋=⌊323⋅4l−2l⌋=⌊323⋅4l−2l−1+31⌋. Since the positive integer 3⋅4l−2l is even, we have 23⋅4l−2l≡4≡1(mod3), so the odd positive integer 23⋅4l−2l−1 is divisible by 3. Therefore, ak=⌊k2k⌋=⌊323⋅4l−2l−1+31⌋=323⋅4l−2l−1 is odd, which finishes the proof.
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.