Skip to main content
OlympiadHQ

Browse · MathNet

Print

Cesko-Slovacko-Poljsko

algebra

Problem

Given positive integers and , the sequence is defined by and for where stands for the product of digits of in its decimal representation (e.g., , ). Prove that there exist positive integers and such that the sequence contains exactly 2009 different numbers.
Solution
Obviously, the sequence is increasing until the first term with the zero digit occurs and is constant following this term. Our aim is to find such values and that the zero digit first occurs in . We will solve the problem in general – given an integer , we present and such that the zero digit first occurs in . Set

Then we have

Second solution. Put

Then we have and obviously

Techniques

Recurrence relationsOtherInvariants / monovariants