Find the number of integers n such that 1+⌊101100n⌋=⌈10099n⌉
A number or a short expression. Spacing and $ signs are ignored.
Solution
Consider f(n)=⌈10099n⌉−⌊101100n⌋. Note that f(n+10100)=⌈10099n+99⋅101⌉−⌊101100n+1002⌋=f(n)+99⋅101−1002=f(n)−1. Thus, for each residue class r modulo 10100, there is exactly one value of n for which f(n)=1 and n≡r(mod10100). It follows immediately that the answer is 10100.
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: Omni-MATH,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.