Consider the integers ,
, , and . For each of these integers, do the
following.
Determine whether the integer is a multiple of .
With the hundreds digit equal to , the tens digit equal to , and the units digit equal to , compute .
What do you notice?
Suppose is a
three-digit integer ( is the
hundreds digit, is the tens
digit, and is the units digit).
Show that if is a multiple of
, then is a multiple of .
Show that if is a
multiple of , then the three-digit
integer is a multiple of
.
Suppose is a
six-digit integer that has each of its digits different from . Show that is a multiple of if and only if is a multiple of .
Think of ways to generalize the fact in part (d).
Problem 1: October 2022
In any triangle, there is a unique circle called its
incircle that can be drawn in such a way that it is tangent to
all three sides of the triangle. For a given triangle, the radius of its
incircle is known as its inradius and is denoted by .
For each side of the triangle (which is tangent to the incircle),
another tangent to the incircle can be drawn in such a way that it is
parallel to that side. The three sides as well as these three new
tangents give a total of six tangents to the incircle. They uniquely
determine a hexagon that we will call the Seraj hexagon of the
triangle.
Finally, for a given triangle, we will denote by its semiperimeter, which is
defined to be half of its perimeter.
The diagram below is of a triangle showing its incircle and Seraj
hexagon.
Sketch the ––
triangle with its incircle and Seraj hexagon. Compute its inradius,
semiperimeter, and the area of its Seraj hexagon.
Find a general expression for the area of a triangle in terms
only of its inradius and semiperimeter.
Find a general expression for the area of the Seraj hexagon of a
triangle in terms of its three side lengths, its semiperimeter, and its
inradius.
What is the largest possible value that can be obtained by
dividing the area of a triangle’s Seraj hexagon by the total area of the
triangle?
Problem 2: November 2022
Let .
For integers , each equal to or , the expression is called a base expansion and represents the
real number
The integers through are called the digits of
the expansion. For example, the base expansion represents the real
number
which can be simplified to get and so .
What are the real numbers represented by and ?
Find a base expansion
of the real number .
Show that and
use this to deduce that for all
integers .
Show that every positive integer has a base expansion and find a base expansion for each positive integer
from through . One approach is to prove and use the
following two facts.
If a real number has a
base expansion, then it has a
base expansion that does not
have two consecutive digits equal to .
If a real number has a
base expansion, then it has a
base expansion that has its
units digit, , equal to .
A bag contains exactly 15 marbles of which are red, are blue, and are green. The marbles are chosen at
random and removed one at a time from the bag until all of the marbles
are removed. One colour of marble is the first to have remaining in the bag. What is the
probability that this colour is red?
Note: It might be useful to familiarize yourself
with the notation of binomial coefficients before attempting
this problem.
Suppose there are red
marbles and blue marbles. As in
the original problem, the marbles are chosen at random and removed from
the bag one at a time until all marbles are removed. One colour of
marble is the first to have
marbles remaining in the bag. What is the probability that this colour
is red?
Suppose there are red
marbles, blue marbles, and green marbles. The marbles are chosen
at random and removed one at a time until all marbles are removed. What
is the probability that red is the colour of marble that is first to be
completely removed from the bag?
Suppose there are red
marbles, blue marbles, and green marbles with . Let be the probability that the red
marbles are the first to be completely removed from the bag and define
and similarly. Determine which of , , and is the smallest and which is the
largest. Does the result agree with your intuition?
Show that the values of , , and depend only on the proportions of
, , and to the total number of marbles. For
example, if one bag has red,
blue, and green marbles and another has red, blue, and green marbles, then the probability
that the red are removed first is the same for both bags.
Problem 4: January 2023
For each positive integer ,
define a function for each integer . That is, is the sum of the first perfect th powers. It is well known
that .
Fix a positive integer .
Let be the set of ordered triples
of integers between and , inclusive, that also satisfy and . Show that there are exactly elements in the set .
With as in part (a), show
that there are elements
in and use this to show that
For each , show that there
are constants such that
for all .
Note: Actually computing the constants gets more and
more difficult as gets larger.
While you might want to compute them for some small , in this problem we only intend that
you argue that the constants always exist, not that you deduce exactly
what they are.
Use part (c) to show that and .
It follows from the fact in part (c) that is a polynomial of degree . With , this means there are constants and such that Use the fact that
and for all to determine through , and hence, derive a formula for
.
Show that is a factor
of for every positive
integer and that is a factor of for every even positive integer
.
Problem 5: February 2023
The sequence has
the property that every integer in the sequence is a divisor of the sum
of the integers adjacent to it. That is, is a divisor of ,
is a divisor of , is a divisor of , and so on.
For , the sequence of positive
integers is called a splendid sequence of length if it satisfies conditions S1, S2,
and S3 found below.
S1. is a divisor of
and is a divisor of .
S2. is a divisor of
for each from through inclusive.
S3. There is no prime number that is a divisor of every integer
in the sequence.
For example, is
a splendid sequence because it satisfies S1, S2, and S3. The sequence
satisfies S1 and S2, but
it is not a splendid sequence because it fails S3 since is a divisor of every integer in the
sequence.
For , is a splendid sequence of
length if it satisfies S1
and S3. Mostly for notational convenience, we also define a splendid
sequence of length to be the
"sequence" . That is, the only
splendid sequence of length
consists of a single integer equal to .
Show that there is only one splendid sequence of length .
Show that there is at least one splendid sequence of every
possible length .
Suppose is a splendid
sequence of length . Show
that for every integer with there is a positive
integer so that
is a splendid sequence of length .
Suppose is a splendid
sequence of length . Show that
.
For each , show that
there are only finitely many splendid sequences of length .
Find a closed form for the number of splendid sequences of length
. Your answer should be an
expression in terms of .
Note: In part (f), we are asking you to find a
closed form for the number of splendid sequences, the existence of which
immediately implies that there are only finitely many. Hence, one way to
answer part (e) is to answer part (f). With that said, we decided to
include part (e) because it can be done without part (f) and (at least
as far as we can tell) it is quite a bit easier than part (f). Part (f)
is very challenging, so the hint will have more detail than usual.
Problem 6: March 2023
For a non-negative integer ,
define to be the first digit
after the decimal point in the decimal expansion of . For example, and so . Note that and that when is a perfect square. You will likely
want a calculator that can compute square roots for this question.
Compute for every
integer strictly between and as well as every integer strictly between and .
Compute for every
integer strictly between and as well as every integer strictly between and .
Show that if is a positive
multiple of , then each digit from
through appears in the list
the same number of times.
For each digit from through , determine how many times occurs in the list
Here are a couple of other things that you might like to think
about. No solution will be provided for either of these questions, but
as always, we would love to hear about any observations you make!
How are the digits through
distributed among the infinite
list
For example, in the long run, are the ten digits distributed roughly
"uniformly"? One way to make sense of this question is to think about
the frequency of each digit among the list for very
large .
Are there similar patterns to those in the earlier parts of this
problem if we consider the first two digits after the decimal place?
What if we consider three or more digits?
Problem 7: April 2023
Let denote the set of all
-tuples of s and s. For example, is the set of all ordered pairs of
s and s or . To
improve readability, we will omit the commas and parentheses from the
elements of . For example, the
elements of will be denoted by
, , , , , , , and .
Variables referring to elements of will be bold lowercase letters. For
example, we might refer to elements in as , or , and so on. To refer to the
coordinates of elements in , we
will use square brackets. For example, if , an element in , then , , , , and .
For two elements and
in , the Hamming distance,
denoted between
and is equal to the number of
coordinates where they differ. For example, if and , then because and , but for , , and . It is important to convince yourself
that for any
and .
The notion of a graph was defined in the extra information
about the February 2023 problem, but there are also plenty of places
online that have definitions. We will keep things simple here and define
a graph to be a collection of vertices, some of which are
connected to each other by edges. When we draw a graph, a
vertex will be represented by a circle and an edge will be represented
by a line segment from one vertex to another. Two examples of graphs are
depicted below. The one on the left has four vertices and the one on the
right has eight. Note that two edges intersecting does not necessarily
imply the presence of a vertex.
For each , we define a graph
with vertices called the
natural graph of . In
the natural graph of , it is
possible to label every vertex by exactly one element of such that there is an edge between
two vertices exactly when their Hamming distance is . The two examples above are the natural
graphs of and . They are shown again below with
their vertices labelled.
A walk in a graph from vertex to vertex is a sequence of vertices starting at
and ending at with the property that there is an edge
connecting every pair of consecutive vertices in the sequence. The
length of a walk is the number of edges it uses. For example,
let , , , and be the vertices labelled by , , , and in the natural graph of , respectively. Then and are walks of length from to . The distance between and in a graph is equal to the shortest
possible length of a walk from to
. In the example above, and have a distance of because there are walks of length , but there are no shorter walks from
to .
Let and be elements of . Show that is equal to the distance
between and in the natural graph of .
For each with , determine the number of
two-element subsets of that satisfy .
Suppose we were to relabel the vertices of the natural graph of
by permuting the labels. That
is, we keep the graph the same but use the elements of to label a vertex of the graph in
some other way. For example, in , we might leave and where they are and swap the positions
of and , as shown.
When this is done, the distance in the new graph between elements of
and is not necessarily equal to any more. The table
below has the two-element subsets of in the first column, in the second column,
and their distance in the relabelled graph in the third column.
new distance
Among the four subsets with , there are two that
have a distance in the relabelled graph of and two that have a distance in the
relabelled graph of .
Now for the question: For each , find a way to permute the elements of
so that the following happens:
Among all two-element subsets of with , there are the same
number with each possible distance in the relabelled graph.
Problem 8: May 2023
This month’s problem is based on Problem 6 part (b) of the 2023 Euclid Contest. Here is a modified and rephrased version of that problem:
A square is drawn in the plane with vertices at , and . Two blue lines are drawn with
slope 3, one passing through
and the other through . Two red lines are drawn
with slope , one
passing through and the other
through . What is
the area of the square bounded by the red and blue lines?
The answer to this question is . We suggest convincing
yourself of this before attempting the rest of the problem. The fact
that this small square has an area exactly one tenth of the larger
square suggests that there is a way to answer this question by showing
that exactly squares the size of
the small one should fit into the large square. Let’s explore!
Here is some terminology that we will use in this problem.
Definition: A lattice point is a point
for which and are both integers.
Definition: A square whose vertices are at lattice points is called a
unit lattice square. We will denote by the unit lattice square with vertices
, , , and .
Definition: denotes the line segment
connecting to the point . Note that this line has slope
.
Definition: An – lattice line is a line with slope
that passes through at least one
lattice point.
The next two definitions are more complicated. There are examples
given after they are stated.
Definition: The tricky unit square, , is a modified version of
(see above) with the property
that if a line reaches an edge of , it "jumps" to the opposite
side and continues with the same slope. For example, if a line reaches
the top edge of , it
continues with the same slope from the bottom edge directly below where
it reached the top edge. If a line reaches a vertex of , then it has simultaneously
reached two edges. In this situation, it continues with the same slope
from the opposite vertex of .
Definition: Let be a rational number written
in lowest terms. The – loop on is the line passing through
with slope .
Below are diagrams, from left to right, of the – loop, the – loop, and the – loop on . In each diagram, equal
letters mark places where the line jumps from one side of the square to
the opposite side.
Each of the loops above eventually come back to their starting point
and repeat. This happens because is rational (think about
this!). Notice that in the image of the – loop (the middle image),
the loop starts at instead of
. This is because a line of
negative slope starting at
(on the bottom edge) immediately jumps to the top edge and continues
from . It is worth thinking
about how all four vertices of really represent the same
point.
Below is an image of
with the – loop in blue
and the – loop in red.
These two loops divide
into smaller squares. The squares numbered , , , , , and are split in two pieces each across
edges of . Notice that
both the loops pass thorough the point since the four vertices of the
square are the same point. This means, if we count the four vertices as
one intersection point, the two loops intersect exactly times (count them!). Think about how
this compares to the Euclid problem mentioned earlier.
A square is divided by six lines: three parallel blue lines with slope and three parallel red lines with slope .
The leftmost blue line goes from the bottom-left vertex of the square to a point one-third of the way along the top side of the square. The next two blue lines start at points one-third and two-thirds along the bottom side of the square.
The topmost red line goes from the top-left vertex of the square to a point one-third of the way down the right side of the square. The next red lines start at points one-third and two-thirds down the right side of the square.
These intersecting lines create sixteen regions that combine to form ten identical smaller squares within the square. Viewing these regions as forming a tilted and non-uniform four by four grid within in the square, the regions in the top row, from left to right, are numbered 1, 2, 3, 4, those in the second row are numbered 4, 7, 8, 5, those in the third row are numbered 5, 9, 10, 6, and those in the bottom row are numbered 6, 1, 2, 3. The regions at the centre, 7, 8, 9, 10, are intact tilted squares. The other regions come in pairs consisting of a smaller piece and a larger piece of a square, both with the same number.
For each pair of loops below, draw with that pair of loops, count
the number of times the loops intersect, and count the number of squares
into which the loops divide .
The – loop and
the – loop.
The – loop and
the – loop.
The – loop and
the – loop.
The – loop and
the – loop.
In the remaining problems, and
are positive integers that have
no positive divisors in common other than .
How many line segments make up the – loop?
How many – lattice lines intersect
?
Explain why the number of points of intersection of the – loop and the – loop on is equal to the number of
small squares into which the loops divide . Remember that the four
vertices of represent
the same point.
How many – lattice lines intersect
?
Compute the area of the small squares in created by the – loop and the – loop. Our solution will
take for granted that these small squares all have the same area, but
you might like to think about how to prove this.