Let n be a positive integer. Prove that at least one of the integers [2n⋅2],[2n+1⋅2],…,[22n⋅2] is even, where [a] denotes the integer part of a.
Solution
Assume by contradiction that all integers are odd. Then, we have 2a−1<2n2<2a for some positive integer a. Multiplying inequalities (1) by 2, we get 4a−2<2n+12<4a. Since the integer [2n+12] is odd, it follows 4a−1<2n+12<4a. In analogous way, after n steps, we get 2n+1a−1<22n2<2n+1a From the left inequality above it follows a−2n−12<2n+11 hence a+2n−12a2−22n−1<2n+11 From the right inequality in the first step we have 2a>2n2 hence a2>22n−1, that is a2−22n−1≥1. Using this inequality, from above it follows a+2n−121<2n+11 hence 2n+1<2n−12+a<2n−12+21(2n2+1) From this we get 2n+2<2n+12+1, that is 2<2+2n+11<23+21=2 contradiction.
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 and solution reproduced as published; topic and difficulty added by this site.