Base Systems (AIME / USAJMO / AMO)
Proof-style AIME / USAJMO / AMO statements — develop a full argument; type only the final answer.
Proof track: treat each problem as a full olympiad writeup on paper. Here you only enter the final answer (integer or short expression).
Base Systems: core idea
Example problem: hint and answer
**(Proof track.)** Give a complete justification. Find in base .
Hint: Expand the numeral as a polynomial in its base and enforce valid-digit constraints. Answer: 432.
Practice (9 problems — type your answers)
No proof submission required — answers only.
1. **(Proof track.)** Give a complete justification. Find base if .
2. **(Proof track.)** Give a complete justification. Write in base .
3. **(Proof track.)** Give a complete justification. For what base is a square equal to ?
4. **(Proof track.)** Give a complete justification. Compute in base .
5. **(Proof track.)** Give a complete justification. Find the sum of digits of in base .
6. **(Proof track.)** Give a complete justification. Find .
7. **(Proof track.)** Give a complete justification. If , find .
8. **(Proof track.)** Give a complete justification. Find largest base in which .
9. **(Proof track.)** Give a complete justification. Evaluate in base ten.