Problem of the Month
Hint for Problem 1: October 2023
For an integer , think about
how and compare to each other. The
relationship is most interesting when is a multiple of .
Our solution will make use of some basic properties of remainders.
For positive integers and , the remainder when dividing by can be found by first determining , the greatest multiple of with , then computing the remainder as . The integer can be found by computing and rounding down. For
example, the remainder when dividing by is because is the greatest multiple of that does not exceed (in this case, ), and so the remainder is . We assume this idea is familiar,
but here are a couple of things to think about and keep in mind.
For integers and with , the remainder, , when dividing by satisfies .
For a fixed positive integer , the remainders when dividing the
positive integers
cycle through the integers repeatedly in that order. Importantly, if we think of
as coming "after" , the remainders for consecutive
integers are consecutive.
The remainder when dividing by is exactly when is a multiple of .
If you have seen modular arithmetic before, it could be useful in
writing a solution. Our solution will not use modular arithmetic, but we
suggest reading about it anyway since it is quite useful.
Below are some specific hints for the given questions.
Show that if and are both odd, then is a multiple of .
First, try to find the maximum length of a -list that does not contain a multiple
of . For an integer , how do the remainders when and are divided by relate to each other?
By a rather famous divisibility rule, a positive integer is a
multiple of if and only if the
sum of its digits is a multiple of .
First show that an -list
that starts with a multiple of
has length at most . Think about
the remainders when and are divided by .