benchmarks.wiki / Public workspace

AMC (AIMO validation set) / https://artofproblemsolving.com/wiki/index.php/2022_AMC_12B_Problems/Problem_9 / The sequence a₀,a₁,a₂,⋯ is a strictly increasing arithmetic sequence of positive integers such that 2^(a₇)=2²⁷⋅a₇. What is the minimum possible value of a₂?

Problem

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

problem

The sequence a0,a1,a2,a_0,a_1,a_2,\cdots is a strictly increasing arithmetic sequence of positive integers such that 2a7=227a7.2^{a_7}=2^{27} \cdot a_7. What is the minimum possible value of a2a_2?
Plain-text mathematical notation (without MathML)
The sequence a₀,a₁,a₂,⋯ is a strictly increasing arithmetic sequence of positive integers such that 2^(a₇)=2²⁷⋅a₇. What is the minimum possible value of a₂?
Original LaTeX notation
The sequence $a_0,a_1,a_2,\cdots$ is a strictly increasing arithmetic sequence of positive integers such that \[2^{a_7}=2^{27} \cdot a_7.\] What is the minimum possible value of $a_2$?

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