I give this problem each year in a problem-solving seminar. Here is the solution that I wrote up. I am using ff instead of varphivarphi and enen instead of xnxn.
Let x=(x1,x2,dots)x=(x1,x2,dots). Since 2n2n
and 3n3n are relatively prime, there are integers anan and bnbn
for which xn=an2n+bn3nxn=an2n+bn3n. Hence f(x)=f(y)+f(z)f(x)=f(y)+f(z), where y=(2a1,4a2,8a3,dots)y=(2a1,4a2,8a3,dots) and z=(3b1,9b2,27b3,dots)z=(3b1,9b2,27b3,dots). Now for
any kgeq1kgeq1 we have
f(y)=f(2a1,4a2,dots,2k−1ak−1,0,0,dots)f(y)=f(2a1,4a2,dots,2k−1ak−1,0,0,dots)
qquad+f(0,0,dots,0,2kak,2k+1ak+1,dots)qquad+f(0,0,dots,0,2kak,2k+1ak+1,dots)
qquad=0+2kf(0,0,dots,0,ak,2ak+1,4ak+2,dots).qquad=0+2kf(0,0,dots,0,ak,2ak+1,4ak+2,dots).
Hence f(y)f(y) is divisible by 2k2k for all kgeq1kgeq1, so
f(y)=0f(y)=0. Similarly f(z)f(z) is divisible by 3k3k for all kgeq1kgeq1, so f(z)=0f(z)=0. Hence f(x)=0f(x)=0.
Now let ai=f(ei)ai=f(ei). Define integers 0<n1<n2<cdots0<n1<n2<cdots such that for all kgeq1kgeq1,
sumki=1|ai|2ni<frac122nk+1.sumki=1|ai|2ni<frac122nk+1.
(Clearly this is possible --- once n1,dots,nk have been chosen,
simply choose nk+1 sufficiently large.) Consider x=(2n1,2n2,dots). Then
f(x)=f(a1e1+cdots+akek+2nk+1(ek+1+2nk+2−nk+1ek+2+cdots)) qquad=sumki=1ai2ni+2nk+1bk,
where bk=f(ek+1+2nk+2−nk+1ek+2+cdots). Thus by the
triangle inequality,
left|2nk+1bkright|<left|sumki=1ai2niright|+|f(x)| qquad<frac122nk+1+|f(x)|.
Thus for sufficiently large k we have bk=0 [why?]. Since
bj−2nj+2−nj+1bj+1=f(ej+1)mbox[why?],
we have f(ek)=0 for k sufficiently large.}
No comments:
Post a Comment