AQuA-RAT train #79212 · Algebra · Algebra word problems
A sequence an is recursively defined where an = 3(an-1-1000) for n…
A sequence an is recursively defined where an = 3(an-1-1000) for n > 0. Compute the smallest integer x such that when a0 = x, an > a0 for all n > 0.
AQuA-RAT — Algebra Question Answering with Rationales (Ling et al., DeepMind, 2017) · train #79212
Stuck? A gentle nudge
No hints for this one.
Your answer
Checked against the answer in AQuA-RAT.