12.07.2015 Views

Solutions - Georg Mohr-Konkurrencen

Solutions - Georg Mohr-Konkurrencen

Solutions - Georg Mohr-Konkurrencen

SHOW MORE
SHOW LESS
  • No tags were found...

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

argument starting from f(2001 2 ) ≠ 0 instead of f(2001) shows thatf(2001 2 ) = 2f(1) − 1 2 . So2f(1) − 1 (2 = 2f(1) 2f(1) − 1 ).2Since 2f(1) − 1 2 = f(2001) ≠ 0, we have f(1) = 1 , which implies2f(2001) = 2f(1) − 1 2 = 1 2 .12. By Hölder’s inequality,n∑ n∑(∑ n ) 3/5 (∑ n ) 2/5a 3 = (a i · a 2 i ) a 5/3i · (a 2 i ) 5/2 .i=1 i=1i=1i=1We will show thatn∑(∑ n ) 5/3 a i . (4)i=1a 5/3iLet S =n∑i=1( aiSi=1n∑a i , then (4) is equivalent toi=1) 5/3 1 =n∑i=1a iS ,which holds since 0 < a iS 1 and 5 (3 > 1 yield ai) 5/3 a i S S . So,n∑(∑ n ) (∑ n ) 2/5a 3 i a i · a 5 i ,i=1which givesi=1n∑i=113. Consider the equation( 7) x ( 1 +9 9i=1a i 35 2/5 > 3 2 , since 25 > 5 2 and hence 2 > 5 2/5 .) x= 1 .9

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!