MathDB

Let a

9

-digit number be balanced if it has all numerals

1

9

. Let

S

be the sequence of the numerals which is constructed by writing all balanced numbers in increasing order consecutively. Find the least possible value of

k

such that any two subsequences of

S

which has consecutive

k

numerals are different from each other.

Problem Statement