olymmath

AMO-Bench 2025 Problem 13

  • Answer

Let {ak}\{a_k\} be a sequence of non-negative integers, and {bk}\{b_k\} be a sequence of positive real numbers. Given that: 1.(∑n=12023anbn)(∑k=06731(k+675)(1348−k))=∑k=16741k(2k−1)\left(\sum_{n=1}^{2023} a_n b_n\right)\left( \sum_{k=0}^{673} \frac{1}{(k+675)(1348-k)} \right)= \sum_{k=1}^{674}\frac{1}{k(2k-1)} 2.∑k=113641761k(2k−1)∑k=013641751(k+1364177)(2728352−k)=1+∑n=12023an2bn2\frac{\sum_{k=1}^{1364176}\frac{1}{k(2k-1)}}{\sum_{k=0}^{1364175} \frac{1}{(k+1364177)(2728352-k)}} = 1+\sum_{n=1}^{2023} a_n^2 b_n^2 3.(∑k=055194554201(k+5519455422)(11038910842−k))[(∑n=120232an3bn3)−1]=∑k=155194554211k(2k−1)\left( \sum_{k=0}^{5519455420} \frac{1}{(k+5519455422)(11038910842-k)} \right)\left[\left(\sum^{2023}_{n=1}2a^3_nb^3_n \right)-1\right] =\sum_{k=1}^{5519455421} \frac{1}{k(2k-1)} Find the minimum value of ∑n=12023an4bn4\sum_{n=1}^{2023} a_n^4 b_n^4

Dataset text AMO-Bench. Open licence.

Show the answer

\frac{33497570861567}{2}

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 amo-bench/2025/p13 · Tag 83YP7F379Y · Edit this page on GitHub · Keys: j next, k previous