Putnam 1975 B3 Session B Let nnn be a positive integer. Let S={a1,…,ak}S=\{a_1,\ldots, a_{k}\}S={a1,…,ak} be a finite collection of at least nnn not necessarily distinct positive real numbers. Let f(S)=(∑i=1kai)nf(S)=\left(\sum_{i=1}^{k} a_{i}\right)^{n}f(S)=(i=1∑kai)n and g(S)=∑1≤i1<…<in≤kai1⋅…⋅ain.g(S)=\sum_{1\leq i_{1}<\ldots<i_{n} \leq k} a_{i_{1}}\cdot\ldots\cdot a_{i_{n}}.g(S)=1≤i1<…<in≤k∑ai1⋅…⋅ain. Determine supSg(S)f(S)\sup_{S} \frac{g(S)}{f(S)}supSf(S)g(S) . 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. ISL 1995 A6PL-OM 2023 Problem 3NMC 2012 Problem 3Putnam 1953 B2JBMO-SL 2014 A9 PreviousB2 NextB4 Locator putnam/1975/b3 · Tag 9E93PXB4EB · Edit this page on GitHub · Keys: j next, k previous