olymmath

DE-BUNDESWETTBEWERB 2009 Problem 4

  • Round 1

A positive integer is called decimal palindrome if its decimal representation zn...z0z_n...z_0 with zn≠0z_n\ne 0 is mirror symmetric, i.e. if zk=zn−kz_k = z_{n-k} applies to all k=0,...,nk= 0, ..., n . Show that each integer that is not divisible by 1010 has a positive multiple, which is a decimal palindrome.

Dataset text AI-MO AoPS. Quoted with source.

Official text: Bundeswettbewerb Mathematik 2009 official paper, page 1.

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 de-bundeswettbewerb/2009/p4 · Tag WV6ZGWSFG1 · Edit this page on GitHub · Keys: j next, k previous