olymmath

HMMT 2016 A7

  • Algebra
  • Answer

Determine the smallest positive integer n≥3n \geq 3 for which

A≡210n( mod 2170)A \equiv 2^{10 n} \left(\bmod 2^{170}\right)

where AA denotes the result when the numbers 210,220,…,210n2^{10}, 2^{20}, \ldots, 2^{10 n} are written in decimal notation and concatenated (for example, if n=2n=2 we have A=10241048576A=10241048576 ).

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

14

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator hmmt/2016/a7 · Tag YZ7KKZ2GCH · Edit this page on GitHub · Keys: j next, k previous