Refereed problems
The class is split into three groups, based on last name.
- Group 1: Last names beginning with the letters A through J
- Group 2: Last names beginning with the letters K through L
- Group 3: Last names beginning with the letters N through Y.
Due Tuesday, June 14th
Definition Let
be an integer. We say that
if
.
All groups:
Prove the following statements.
- For every integer
, we have that
.
- For every integer
, we have that
implies that
.
- For every three integers
, we have that
and
implies that
.
This shows that
is an equivalence relation.
In addition, each group should prove their part of the following.
Group 1: Show that if
and
, then we also have that
.
Group 2: Show that if
and
, then we also have that
.
Group 3: Show that if
and
, then we also have that
.
We will discuss in class how the refereeing process works.
Due Tuesday, June 21st
Group 1: Show that if
is an injective function, then there is some function
which is surjective.
Group 2: Show that if
is a surjective function, then there is some function
which is injective.
Group 3: Show that if
is a function and if there is some function
such that
is the identity function, then
must be injective.
Due Tuesday, June 28th
Recall that Pascal's triangle is defined via the relations
and
, where the first number denotes the row, and the second the diagonal column.
Prove the following using induction.
Hint: In each case, consider writing out the first few terms to make sure that you have the indexing right. What is the variable that you should use in your induction step?
Group 1: Show that, for every integer
, the sum of all of the entries in the
-th row is
.
Group 2: Show that, for every integer
, and for every fixed integer
, that
.
Group 3: Show that, for every fixed integer
, and for every integer
, that
.
Due Tuesday, July 19th
The goal is for each group to prove one of the ubiquitous limit laws of first-year calculus, in the context of sequences.
Let
and
be sequences such that
and
![{\displaystyle \lim _{n\to \infty }b_{n}=M}](https://wiki.ubc.ca/api/rest_v1/media/math/render/svg/98a5bf4d925721dbfb1368bde29eb294b5172361)
.
Let k be any real number.
Group 1: Show that
exists and is equal to LM. Hint: Note that
and remember the properties of the absolute value function.
Group 2: Show that
exists and is equal to
.
Group 3: Show that
exists and is equal to kL.