Mary has a sequence m2,m3,m4,…, such that for each b≥2,mb is the least positive integer m for which none of the base-b logarithms logb(m),logb(m+1),…,logb(m+2017) are integers. Find the largest number in her sequence.
A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.
Solution
It is not difficult to see that for all of the logarithms to be non-integers, they must lie strictly between n and n+1 for some integer n. Therefore, we require bn+1−bn>2018, and so mb=bn+1 where n is the smallest integer that satisfies the inequality. In particular, this means that bn−bn−1≤2018. Note that m2=211+1=2049( since 212−211=2048>2018) and m3=37+1=2188 (since 38−37=4374>2018 ). we now show that 2188 is the maximum possible value for mb. If n=0, then mb=1+1=2. If n=1, then b−1≤2018 and thus mb=b+1≤2020. If n=2, then b2−b≤2018, which gives b≤45, and thus mb=b2+1≤2018+b+1≤2065. If n=3, then b3−b2≤2018, which gives b≤12, and thus mb=b3+1≤123+1=1729. If n=4, then b4−b3≤2018, which gives b≤6, and thus mb=b4+1≤64+1=1297. It then remains to check the value of m4 and m5. Indeed, m4=45+1=1025 and m5=54+1=626, so no values of mb exceeds 2188.
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.
Source: Omni-MATH,
licensed Apache-2.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.