Problem:
The domain of the function f(x)=arcsin(logmβ(nx)) is a closed interval of length 20131β, where m and n are positive integers and m>1. Find the remainder when the smallest possible sum m+n is divided by 1000.
Solution:
The domain of f(x) is the solution of the inequality β1β€logmβ(nx)β€1, or equivalently, mn1ββ€xβ€nmβ. Thus the domain is a closed interval of length 20131β=nmββmn1β=mnm2β1β. Hence n=m2013(m2β1)β. Because m and m2β1 are relatively prime, m must be a factor of 2013=3β
11β
61. The smallest possible value of n is 32013(32β1)β=5368, and the smallest possible sum m+n is 5368+3=5371. The requested remainder is 371β.
The problems on this page are the property of the MAA's American Mathematics Competitions