MathDB
Sequence and product of digits

Source: Argentina TST Iberoamerican 2009 Problem 5

August 25, 2009
number theory unsolvednumber theory

Problem Statement

Let a a and k k be positive integers. Let ai a_i be the sequence defined by a_1 \equal{} a and a_{n \plus{} 1} \equal{} a_n \plus{} k\pi(a_n) where π(x) \pi(x) is the product of the digits of x x (written in base ten) Prove that we can choose a a and k k such that the infinite sequence ai a_i contains exactly 100 100 distinct terms