Problem of the Month 2023-2024
Problem 0: September 2023
In this problem, will always
be a function defined by where , , , and are integers. These integers will vary
throughout the parts of the problem.
Given such a function and a
rational number , we can
generate a sequence by taking for each . That is, , , , and so on. Unless there is
some point in the sequence where is undefined, a sequence of
this form can be made arbitrarily long.
These sequences behave in different ways depending on the function
and the starting value . This problem explores some those
behaviours.
Suppose .
With ,
compute , , and .
Find a rational number
with the property that is
defined, but is not
defined.
Suppose .
With ,
compute , , , and .
Determine all rational values of with the property that there is some
integer for which is undefined. For all other values
of , find simplified formulas
for and in terms of .
Suppose .
With , compute through . Write down decimal approximations of
through (after computing them
exactly).
Suppose is a positive
rational number. Prove that
Suppose is a positive
rational number. Prove that for each . Use this result to convince
yourself that as gets large,
gets close to , regardless of the choice of the
positive value . Can you modify
slightly so that the sequence
always approaches ?
Explore the behaviour of the sequences generated by various
values of for each of the
functions below. Detailed solutions will not be provided, but a brief
discussion will.
Problem 1: October 2023
Given a positive integer , the
digit sum of is the sum
of the base digits of . We will denote the digit sum of by . For example, .
Suppose that is a positive
integer. We will call a list of consecutive positive integers an -list if none of , , , and so on up to is a multiple of . For example, the list is a
-list because the digit sums of
the integers in the list are ,
, , , , and , respectively, none of which is a
multiple of .
This problem explores the maximum length of an -list for a few values of .
Show that the maximum length of a -list is . To do this, you must show that there
is a -list of length and you must also show that no list of
three or more consecutive positive integers can be a -list.
Show that the maximum length of a -list is .
Determine the maximum length of a -list.
Determine the maximum length of an -list.
Problem 2: November 2023
This month’s problem is based on the following general question: If
you draw a "loop" in the Cartesian plane, is it always possible to find
four points on that loop that are the vertices of a square? For example,
the diagram below has a loop (the solid line) and a square drawn (the
dashed line) with its four vertices on the loop.
Although it is a bit informal, it should be sufficient to think of a
"loop" as a curve that you could draw by starting your pencil somewhere
on a page and moving the pencil around the page eventually ending up
where it started. Such a loop could be "smooth" (like a circle),
"jagged" (like a polygon), or some combination of the two.
In each of parts (i) through (v), find four points on the loop
that are the vertices of a square.
the circle with equation
the ellipse with equation
where and are fixed positive real
numbers
the polygon with vertices , , , ,
, and
the boundary of the region enclosed by the parabola with equation
and the line with equation
the boundary of the region enclosed by the parabolas with
equations and
Show that for every acute triangle there are exactly three
squares whose vertices all lie on the perimeter of the
triangle.
Problem 3: December 2023
This month’s problem is an extension of Problem 3 from Part B of the 2023 Canadian Intermediate Mathematics Contest. The original problem was
stated as follows:
The positive integers are written into rows so that Row includes every integer with the following properties:
is a multiple of ,
, and
is not in an earlier
row.
The table below shows the first six rows.
Row 1 |
1 |
Row 2 |
2, 4 |
Row 3 |
3, 6, 9 |
Row 4 |
8, 12, 16 |
Row 5 |
5, 10, 15, 20, 25 |
Row 6 |
18, 24, 30, 36 |
Determine the smallest integer in Row
Show that, for all positive integers , Row includes each of and
Determine the largest positive integer with the property that Row does not include
If you have not already done so, we suggest thinking about the parts
above before proceeding.
For each positive integer ,
determine the largest positive integer with the property that Row does not include . (This generalizes part (c) from
the original problem.)
In the remaining questions,
is defined for each to be
the largest non-negative integer
such that and is not in Row . For example, Row is , so since is not in Row but , , , and are all in Row .
Show that for all
prime numbers . (Looking closely
at the definition of , means that every positive multiple
of from through appears in Row .)
Find an expression for
where and are prime numbers. Justify that the
expression is correct.
Find an expression for where is a prime number and is a positive integer.
Take some time to explore the function further on your own. Are there other
results you can prove about the function beyond what is done in (b), (c)
and (d)? Is there a nice way to compute in general without computing each of
the first rows?
Problem 4: January 2024
In this problem, we will enclose a list of positive integers in
square brackets. For example, is a list of positive
integers of length five. All lists in this problem will be expressed in
non-decreasing order. To denote the list of consecutive
integers from to inclusive, we will use the notation
. For example, denotes the list .
Given a list, , of positive
integers, we will define to be
the increasing list of distinct positive integers that are expressible
as the sum of some, but not all, of the items in . A sum is allowed to consist of just
one item in , and each item in
can be used at most once in a
particular sum.
For example, if ,
then the sums of at least one but not all of the items in are shown below. Therefore, .
A list, , of positive integers
is called compressible if there exists some list with . In this situation, we say that
is compressed by or that compresses . From the example above, we have that
is
compressible and is compressed by .
Find all lists of length four that compress and explain why no list of length
three or less can compress .
Find a list, , that
compresses and is as short
as possible.
Show that for all positive integers , the list is compressible. For each , determine the smallest possible length
of a list that compresses .
Show that for all positive integers there are only finitely many
compressible lists of consecutive
positive integers. That is, for each positive integer , show that there are only
finitely many positive integers
for which is
compressible.
Find the largest positive integer such that is not compressible. (A full
solution will not be provided for this part.)
Problem 5: February 2024
Introduction
This problem explores a counting technique that uses binomial
coefficients. The main problems for this month are in the next section. For anyone who is not already familiar with the
notation of binomial coefficients, this section includes an
introduction with a few standard exercises.
For non-negative integers and
, the expression denotes the number of ways
to choose objects from distinct objects. For this reason, the
quantity is
pronounced " choose ".
For example, consider the four letters , , , and . There are ways to select three of them. They are as follows:
Since there are ways to choose of the objects (order does not matter –
it only matters which objects are chosen), we have that .
Try the following exercises. Hints will be provided, but solutions
will not. These exercises are intended as a way to get familiar with the
notation, so they may not be explicitly useful in the main problems.
Show that .
What are and
?
Convince yourself that for .
Convince yourself that
when .
Convince yourself that is equal to the coefficient
of in the expanded form of
. This is why is called a "binomial
coefficient".
It turns out that there is a convenient way to compute binomial
coefficients using factorial notation. If are integers, then . Here,
, pronounced " factorial", is defined so that when and , and for integers . It
is also a useful exercise to think about why this formula for works.
Main Problems
For a positive integer ,
show that is the
answer to each of these three questions. Think about why the answers to
all three questions are the same.
What is ?
How many pairs of
non-negative integers satisfy ?
How many triples of
non-negative integers satisfy ?
Let and be integers. Show that the
following two questions have the same answer and express the common
answer as a single binomial coefficient.
How many ways are there to place indistinguishable balls in distinguishable cups?
How many non-negative integer solutions are there to the equation
?
Let and be integers. By counting -tuples of non-negative integers that satisfy , prove the
identity Clarification: The quantity on
the left in the equation above is the sum of the binomial coefficients
where ranges from to .
Determine the number of non-negative integers with that have a digit sum of .
For a positive integer where
the are the digits of , the alternating sum of is the expression . For
example, the alternating sum of is . Determine the number of
non-negative integers with at most digits that have an alternating sum
equal to .
How many ways are there to choose integers , , and such that and ?
Problem 6: March 2024
This month’s problem is an introduction to some of the basic ideas
that come up when studying polynomials. It is presented with many
exercises interspersed among some definitions. Some of the exercises are
computational and some are theoretical.
Complex Numbers: The polynomial does not have any real roots.
Because of this, we "invent" a root, and it is traditionally called
for "imaginary". That is, we
declare that is a number such
that or . From a desire to do arithmetic
with numbers "like" , we declare
that a complex number is a number of the form where and are real numbers. For example, and are complex numbers. Remembering
that and using expected
arithmetic rules, we can add and multiply complex numbers. For example,
Using the quadratic formula, complex
numbers give roots to all real quadratics. For example, the quadratic
has a discriminant
of , and so it has
no real roots. However, if we accept that means "a number that squares
to ", we can infer that or could reasonably be considered as
. Indeed, using the
quadratic formula, we get If you are new to complex numbers, or you just
want to have some fun, you might want to check that and using the methods for adding
and multiplying complex numbers demonstrated above.
For the next three exercises, it will be useful to remember that if
is a root of a polynomial , then is a factor of .
Find all roots of the polynomial .
Find all roots of the polynomial .
Find all roots of the polynomial .
Definition: A polynomial is called a rational
polynomial if all of its coefficients are rational numbers. The set
of rational polynomials is denoted by .
Definition: Suppose has degree at least
. We say that is reducible in (or reducible over
) if there are
rational polynomials and , both of degree at least , such that . We say that is irreducible over if it is not reducible
over . In other words,
is irreducible over if it cannot be factored as a
product of rational polynomials of degree lower than that of .
Determine whether each given polynomial is reducible or
irreducible over .
Definition: A complex number is called algebraic if it
is a root of some non-constant rational polynomial. That is, is algebraic if there is a
polynomial of
degree at least such that . The degree of the
algebraic number is the
smallest positive integer such
that there is a rational polynomial of degree with . [The word "positive" is
important because every number is a root of the constant polynomial.]
Show that , , , and are all algebraic
numbers and find their degrees. It might be easier to find the degrees
after thinking about some of the later questions.
Suppose is an
algebraic number of degree . Prove
that there is a unique irreducible polynomial of degree with leading coefficient equal to such that .
Note: Numbers that are not algebraic are called
transcendental numbers. Two famous examples of transcendental
numbers are and .
Definition: If is a polynomial and is a root of , then is a repeated root of
if there is a polynomial such that . Note that might be a complex number, which
means could have complex
coefficients.
Let . Find
complex numbers
such that . In
other words, find all roots of .
Hint: Some of the roots are small integers and every root corresponds a
linear factor.
Given a polynomial of
degree , if we expand the
expression (here, is another variable), we can write
as
for unique polynomials .
For the polynomial from
part (g), determine the polynomials and described above and find all
roots of and .
Suppose that is a
polynomial and that is a root of
. Prove that is a repeated root of if and only if is a root of .
Prove that if and are irreducible rational polynomials
with a root in common, then there is a rational number such that .
Prove that an irreducible rational polynomial cannot have a
repeated root.
Note: The division algorithm for
polynomials might be useful in some of the later problems. It will
be explained briefly in the hint.
Problem 7: April 2024
Curves in the plane are often given as the set of points that satisfy some equation in and . For example, the set of points that satisfy is a parabola, the set of points
that satisfy is a line, and the set of points
that satisfy is the circle of radius centred at the origin.
Another way to express a curve in the plane is using
parametric equations. With this type of description, we
introduce a third variable, ,
called the parameter, and each of and is given as a function of . This is useful for describing the
position of a point that is moving around the plane. For example,
imagine that an ant is crawling around the plane. If its -coordinate at time is and its -coordinate at time is , then its position at time is .
A particle’s position at time is . That is, its -coordinate at time is and its -coordinate at time is .
Plot the position of the particle at , , , , and .
Show that every position the particle occupies is on the line
with equation .
Sketch the path of the particle from through .
A particle’s position at time is . Sketch the path of the
particle from through .
A particle’s position at time is .
Plot the position of the particle at for the integers through . Sketch the path of the particle
from through .
Show that every position the particle occupies is on the curve
with equation .
Circle 1 is centred at the origin, Circle 2 is centred at , and both circles have radius . The circles are tangent at . Circle 2 is "rolled" in the
counterclockwise direction along the outside of the circumference of
Circle 1 without slipping. The point on Circle 2 that was originally at
(the point of tangency)
follows a curve in the plane. Find functions and so that the points on this curve are
for .
The setup in this problem is similar to (d). Circle 1 is centred
at the origin and has radius and
Circle 2 is centred at and
has radius so that the two
circles are tangent at .
Circle 2 is rolled around the inside of the circumference of Circle 1 in
the counterclockwise direction. Describe the curve in the plane followed
by the point on Circle 2 that is initially at .
Circle 1 is centred at the origin and has radius . Circle 2 has radius , is inside Circle 1, and the two
circles are initially tangent at . When Circle 2 is rolled around the
inside of Circle 1 in the counterclockwise direction, the point on
Circle 2 that was initially at will follow some curve in the
plane.
Show that when , the points on the curve
satisfy the equation .
Show that the curves for and are exactly the same and
that the point initially at
travels this curve in opposite directions for the two radii.
Problem 8: May 2024
This month’s problem is an extension of Question
4 from the 2024 Galois Contest. It is not necessary to try the
problem before attempting the questions below.
In an rectangular
grid, we say that two cells are neighbours if they share an
edge. The neighbourhood of a cell is the cell itself along with
its neighbours.
An grid is called a
Griffin Grid if each of its cells contains either a or a and the integer in every cell is equal
to the product of the other integers in its neighbourhood.
For example, the grid
below is a Griffin Grid. The three shaded regions are the neighbourhoods of the cells in Row 1 and Column 1, Row 1 and Column 8, and Row 4 and Column 4.
The Galois problem restricted this definition to . Here we want to explore what happens
more generally. If a question is marked with an asterisk , it means I was unable to solve it.
Solutions will not be provided for these problems, but I would love to
hear if you solve one!
Show that an grid
with or in every cell is a Griffin Grid if and
only if the cells in every neighbourhood have a product of .
For every , determine the
number of , , and Griffin Grids. Determining the
number of Griffin Grids
in general is essentially what is required to answer part (c) of the
Galois question.
Show that the number of Griffin Grids is of the form for some integer with .
For general , determine
for which there exists with the property that the number of
Griffin Grids is exactly
.
Show that for all there
exist infinitely many for which
there is exactly one
Griffin Grid.
Show that for all there
exist infinitely many for which
there are distinct Griffin Grids.
* Find a simple general way to calculate the number of Griffin Grids.