benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / The Fibonacci numbers are defined by F₁=F₂=1, and F_(n)=F_(n−1)+F_(n−2) for n≥3. If the number (F₂₀₀₃)/(F₂₀₀₂)−(F₂₀₀₄)/(F₂₀₀₃) is written as a fraction in lowest terms, what is the…

Problem

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

problem

The Fibonacci numbers are defined by F1=F2=1F_{1}=F_{2}=1, and Fn=Fn−1+Fn−2F_{n}=F_{n-1}+F_{n-2} for n≥3n \geq 3. If the number F2003F2002−F2004F2003 \frac{F_{2003}}{F_{2002}}-\frac{F_{2004}}{F_{2003}} is written as a fraction in lowest terms, what is the numerator?
Plain-text mathematical notation (without MathML)
The Fibonacci numbers are defined by F₁=F₂=1, and F_(n)=F_(n−1)+F_(n−2) for n≥3. If the number (F₂₀₀₃)/(F₂₀₀₂)−(F₂₀₀₄)/(F₂₀₀₃) is written as a fraction in lowest terms, what is the numerator?
Original LaTeX notation
The Fibonacci numbers are defined by $F_{1}=F_{2}=1$, and $F_{n}=F_{n-1}+F_{n-2}$ for $n \geq 3$. If the number $$ \frac{F_{2003}}{F_{2002}}-\frac{F_{2004}}{F_{2003}} $$ is written as a fraction in lowest terms, what is the numerator?

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

task_id
870b29d2-24a2-5675-8d04-a1d3a34073d9
task_key
test--870b29d2-24a2-5675-8d04-a1d3a34073d9
task_revision_id
1
config / split
/ test

Official source

initial import