olymmath

HMMT 2010 T3

  • Team 1

Call a positive integer in base 10k10 k-good if we can split it into two integers y and z , such that y is all digits on the left and z is all digits on the right, and such that y=k⋅zy=k \cdot z. For example, 2010 is 2 -good because we can split it into 20 and 10 and 20=2⋅10.2001020=2 \cdot 10.20010 is also 2 -good, because we can split it into 20 and 010 . In addition, it is 20 -good, because we can split it into 200 and 10 . Show that there exists a 48 -good perfect square.

Dataset text NuminaMath olympiads. Quoted with source.

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/2010/t3 · Tag XXJTRF6EYJ · Edit this page on GitHub · Keys: j next, k previous