Problem:
For positive integers n and k, let f(n,k) be the remainder when n is divided by k, and for n>1 let F(n)=max1β€kβ€2nββf(n,k). Find the remainder when βn=20100βF(n) is divided by 1000.
Solution:
If m>1, then
f(3m,m+1)f(3m+1,m+1)f(3m+2,m+1)β=mβ2,=mβ1, and =mβ
Furthermore,
f(3m,k)f(3m,mβ1)f(3m,m)f(3m,k)β<mβ2 for kβ€mβ2,=3,=0, and =3mβ2k<mβ2 for m+1<kβ€23mβ.β
Therefore F(3m)=mβ2. Because F(n+1)β€F(n)+1 for all n, it follows that F(3m+1)=mβ1 and F(3m+2)=m. Thus
n=20β100βF(n)β=m=7β33β(F(3mβ1)+F(3m)+F(3m+1))=m=7β33β((mβ1)+(mβ2)+(mβ1))=3m=7β33β(mβ1)β27=3β
227(6+32)ββ27=1512.β
The requested remainder is 512β.
The problems on this page are the property of the MAA's American Mathematics Competitions