benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / (Lucas Numbers) The Lucas numbers are defined by L₀=2,L₁=1, and L_(n+2)=L_(n+1)+L_(n) for every n≥0. There are N integers 1≤n≤2016 such that L_(n) contains the digit 1 . Estimate N…

Problem

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

problem

(Lucas Numbers) The Lucas numbers are defined by L0=2,L1=1L_{0}=2, L_{1}=1, and Ln+2=Ln+1+LnL_{n+2}=L_{n+1}+L_{n} for every n≥0n \geq 0. There are NN integers 1≤n≤20161 \leq n \leq 2016 such that LnL_{n} contains the digit 1 . Estimate NN.
Plain-text mathematical notation (without MathML)
(Lucas Numbers) The Lucas numbers are defined by L₀=2,L₁=1, and L_(n+2)=L_(n+1)+L_(n) for every n≥0. There are N integers 1≤n≤2016 such that L_(n) contains the digit 1 . Estimate N.
Original LaTeX notation
(Lucas Numbers) The Lucas numbers are defined by $L_{0}=2, L_{1}=1$, and $L_{n+2}=L_{n+1}+L_{n}$ for every $n \geq 0$. There are $N$ integers $1 \leq n \leq 2016$ such that $L_{n}$ contains the digit 1 . Estimate $N$.

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
7c98dc3d-1998-5fd5-92e9-a5de883998fc
task_key
test--7c98dc3d-1998-5fd5-92e9-a5de883998fc
task_revision_id
1
config / split
/ test

Official source

initial import