olymmath

Putnam 1978 B6

  • Session B

Let pp and nn be positive integers. Suppose that the numbers chkc_{hk} ( h=1,2,…,nh=1,2,\ldots,n ; k=1,2,…,phk=1,2,\ldots,ph ) satisfy 0≤chk≤1.0 \leq c_{hk} \leq 1. Prove that (∑chkh)2≤2p∑chk,\left( \sum \frac{ c_{hk} }{h} \right)^2 \leq 2p \sum c_{hk} , where each summation is over all admissible ordered pairs (h,k).(h,k).

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator putnam/1978/b6 · Tag 8GM63KSJN8 · Edit this page on GitHub · Keys: j next, k previous