« Vrati se
Let f be an injective function from {1,2,3,\ldots} in itself. Prove that for any n we have: \sum_{k=1}^{n} f(k)k^{-2} \geq \sum_{k=1}^{n} k^{-1}.

Slični zadaci

#NaslovOznakeRj.KvalitetaTežina
1983IMO Shortlist 1998 problem A112
2011IMO Shortlist 1999 problem A17
2264IMO Shortlist 2008 problem A124
2265IMO Shortlist 2008 problem A213
2291IMO Shortlist 2009 problem A218
2293IMO Shortlist 2009 problem A410