benchmarks.wiki / Public workspace

Omni-MATH / For each positive integer n , let …0<a, b, c, d<1000000 such that T₁₉₈₈=aS₁₉₈₉−b and U₁₉₈₈=cS₁₉₈₉−d .

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

For each positive integer nn , let \begin{align*} S_n &= 1 + \frac 12 + \frac 13 + \cdots + \frac 1n \\ T_n &= S_1 + S_2 + S_3 + \cdots + S_n \\ U_n &= \frac{T_1}{2} + \frac{T_2}{3} + \frac{T_3}{4} + \cdots + \frac{T_n}{n+1}. \end{align*} Find, with proof, integers 0<a,b,c,d<10000000 < a,\ b,\ c,\ d < 1000000 such that T1988=aS1989−bT_{1988} = a S_{1989} - b and U1988=cS1989−dU_{1988} = c S_{1989} - d .
Plain-text mathematical notation (without MathML)
For each positive integer  n , let \begin{align*} S_n &= 1 + \frac 12 + \frac 13 + \cdots + \frac 1n \\ T_n &= S_1 + S_2 + S_3 + \cdots + S_n \\ U_n &= \frac{T_1}{2} + \frac{T_2}{3} + \frac{T_3}{4} + \cdots + \frac{T_n}{n+1}. \end{align*} Find, with proof, integers 0<a, b, c, d<1000000 such that T₁₉₈₈=aS₁₉₈₉−b and U₁₉₈₈=cS₁₉₈₉−d .
Original LaTeX notation
For each positive integer  $n$ , let \begin{align*} S_n &= 1 + \frac 12 + \frac 13 + \cdots + \frac 1n \\ T_n &= S_1 + S_2 + S_3 + \cdots + S_n \\ U_n &= \frac{T_1}{2} + \frac{T_2}{3} + \frac{T_3}{4} + \cdots + \frac{T_n}{n+1}. \end{align*} Find, with proof, integers $0 < a,\ b,\ c,\ d < 1000000$ such that $T_{1988} = a S_{1989} - b$ and $U_{1988} = c S_{1989} - d$ .

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import