Before presenting solutions to the various parts of this question, we
present a few general facts that will be used throughout the solutions.
As well, we will often denote a list of integers enclosed in brackets.
For example, we might write instead of . This is to emphasize when we
want to think of a list is a single object to which we can refer.
The list has and , both of which are odd.
Therefore, is a -list of length . We will now show that a list of three
consecutive positive integers cannot be a -list.
Suppose is a positive integer
with the property that and
are both odd. Since is odd, is even. We are assuming that
is odd, and since is even, we conclude that .
By Fact 1, the units digit of
must be (otherwise ), so the units digit of
is . Again by Fact 1, , and since is odd, is even.
Now consider the list . If and are both odd, we have shown that
is even. This means it is
impossible for , , and to all be odd, so we conclude that
a -list of length cannot exist.
The arguments presented in this part and in part (d) rely on
examining the location of multiples of in lists of consecutive integers. For
this part, because of Fact 2, seven consecutive integers will have seven
consecutive digit sums unless a multiple of causes a carry. To build a -list of length more than six, there
needs to be a multiple of
somewhere in the middle to avoid ever having seven consecutive digit
sums. You might be able to guess from this that the maximum length
should be around .
Suppose
is an arbitrary list of
consecutive non-negative integers. We will show that cannot be a -list and this will show that a -list cannot have length .
Since contains consecutive integers, it must contain
at least one multiple of . Thus,
there must be some with such that is a multiple of .
Case 1: .
Since , . The list contains the integers through , so we conclude that the seven
integers are
all in . Moreover, the smallest
multiple of after is , so none of is a multiple of
since they are all strictly
between two consecutive multiples of .
By Fact 2, the integers are
consecutive. Any list of seven consecutive integers must contain a
multiple of , so we conclude that
is not a -list.
Case 2: .
Since , which can be rearranged to
get . By similar
reasoning to the beginning of Case 1, the seven integers are all in . As well, they are strictly between
and , which are consecutive multiples of
. Therefore, none of is a multiple of
.
By Fact 2, are
consecutive, so one of them must be a multiple of . Therefore, is not a -list.
Cases 1 and 2 address all possibilities for the location of a
multiple of in . In both cases, is not a -list. We conclude that a list of consecutive non-negative integers
cannot be a -list.
To help find a -list of length
, we can modify the reasoning
above slightly. To that end, suppose is a -list. In the previous paragraphs, we
essentially used the fact that if seven consecutive non-negative
integers do not include a multiple of , then one of their digit sums must be
a multiple of . Therefore, for
to be a -list, every sublist of
seven-consecutive integers must contain a multiple of . We leave it to the reader to verify
that this forces to be a
multiple of .
Since is a multiple of , the closest multiples of to are and . Therefore, the list does not contain a
multiple of , and the only
multiple of in the list is . By Fact 2, and are lists of six consecutive integers.
We are assuming is a -list, so no integer in either of these
lists is a multiple of . By
Fact 3, the remainder after dividing by is . Also by Fact 3, the remainder
after dividing by is .
To summarize, if is a -list, then the following must be
true.
The first condition implies that has a units digit of , so suppose that has trailing s. By Fact 4, . The second two
conditions imply that there are integers and such that and . Substituting into , we obtain which can be
rearranged to get .
We know that is a positive
integer, and this shows that
must be a multiple of . The
smallest positive integer with
the property that is a
multiple of is since , which is a multiple of .
We are looking for an integer
such that ends in three s and has the property that is six more than a multiple of
. Thus, will have the form where is some string of digits. In fact,
has a remainder of
when divided by , so we set or . Indeed, if we set the digit sums of the integers in are , none of which is a multiple of . Therefore, is a -list of length .
This is actually the earliest -list of length . Others can be found by prepending
digits to 994 in such a way that the number of trailing s of does not change, and the remainder
after dividing the digit sum by
does not change. This can be done by prepending any digits that have a
sum that is a multiple of ,
provided the rightmost new digit is not a .
For example, we could take to
be , , , , and so on.
Following the reasoning from (b), one might think that we can
find a -list of length . Specifically, we might expect
that we can find a list of the form where is
a multiple of so that there are
never nine consecutive integers without a multiple of . In fact, the maximum length of a
-list is eight, so the approach in
part (b) cannot be applied here. You might like to try to follow the
reasoning from part (b) through to see exactly what goes wrong. The
proof given here uses the well-known fact that a positive integer is a multiple of if and only if is a multiple of .
A list of nine consecutive integers must contain a multiple of , so it must contain an integer whose
digit sum is a multiple of .
Therefore, a list of consecutive
integers cannot be a -list.
Any list of eight consecutive integers, none of which is a multiple
of , must be a -list since none of the digit sums are
multiples of . An example of a
-list of length is .
It might come as a surprise, but the maximum length of an -list is .
To get an idea of how one might guess this, we will first determine
the maximum length of an -list
that starts with a multiple of .
Suppose
is an -list of length with the property that is a multiple of . By Fact 2, and are
lists of ten consecutive integers. Since we are assuming that is an -list, no integer in either of these
lists is a multiple of .
Therefore, by Fact 3, the remainder after is divided by is and the remainder after is divided by is . This implies the existence of integers
and such that and .
Since is a multiple of , the units digit of is . Suppose has trailing s. By Fact 4, . Substituting and into this equation, we get
which
can be rearranged to get . This means
is a positive integer with the property that is ten more than a multiple of . It can be checked that is the smallest positive integer with
this property.
We have shown the following: if is an -list of length with the property that is a multiple of , then has at least six trailing s. We can use this fact to prove the
following:
An -list that starts with
a multiple of cannot have length
.
An -list cannot have
length .
To prove (i), assume that is an -list of length and that is a multiple of . We will show that this implies
something that is plainly false, which will allow us to conclude that
such an -list cannot exist.
The fact that is an -list implies that the lists and are both -lists. Moreover, is a multiple of , so is a multiple of . Thus, and are both -lists of length that start with a multiple of . By what was established earlier, both
and have at least six trailing
s.
The difference between two integers with at least six trailing s must have at least six trailing s. However, has only one trailing
. We have shown that if an -list starts with a multiple of and has length , then has at least six trailing s. Since has only one trailing , we conclude that it must be
impossible for an -list to have
length and start with a multiple
of . Note: The
technique just used is known as a proof by contradiction.
To prove (ii), we can apply (i). Suppose is a list of
consecutive positive integers.
Among the first ten integers in ,
there must be a multiple of .
Suppose is an integer with such that is a multiple of . Observe that , which means the
list is
completely contained in . The list
has length and starts with a multiple of , so it cannot be an -list by (i). Since contains a sub-list that is not an
-list, it cannot be an -list. Therefore, an -list cannot have length .
We can now use what we have done to find an -list of length . Suppose that is an -list. There must be an integer with such that is a
multiple of . If , then , so is entirely
contained in . This would imply
the existence of an -list of
length that starts with a
multiple of , which is impossible
by (i). Since is
impossible, we conclude that .
We assumed that was an -list and deduced that is a multiple of . The list is completely
contained in , has length , and starts with a multiple of . Therefore, from the argument at the
beginning of the solution to this part, has at least six trailing
s. As well, Since is a multiple of , we can apply Fact 2 to to get that is a list
of consecutive integers. Since
is an -list, none of them is a multiple of
. By Fact 3, the remainder after
is divided by is .
Therefore, we will look for an integer with the property that has trailing s and is more than a multiple of . The integer has which is more than a multiple of , so we guess that , or . It can be checked that the list
is
an -list of length . It also follows from our reasoning
that this is the first such -list.