MACM 101 — Discrete Mathematics I

Exercises on Integers and modular arithmetic.

Due: Friday, December 1st
Reminder: the work you submit must be your own. You are not
allowed to use outside resources containing solutions of the home-
work problems. Also, see instruction at the end of this problem
sheet.

1. Find the binary (base 2), octal (base 8), and hexadecimal (base 16)
expansion of 234567.

2. Add the hexadecimal numbers 49F 7 + C66.

3. Find the greatest common divisor, the least common multiple of a =

2475 and b = 13230. Find numbers u, v such that gcd(a, b) = ua + vb.

4. Prove that for any positive integers a, b it holds that gcd(a, b) = gcd(a, a+
b).

5. Is it true that for any odd n, n ≥ 1, the number 2n + 1 is divisible by

3? Prove your answer.

6. Prove that there are no 3 consecutive odd prime numbers, that is, for
any odd p ≥ 5, at least one of p, p + 2, p + 4 is composite.

7. Let m, n ∈ N be such that gcd(m, n) > 1. Find a, b ∈ Z such that

either a ≡ b (mod m), a ≡ b (mod n), but a 6≡ b (mod mn); or a ≡ b
(mod mn), but a 6≡ b (mod m) or a 6≡ b (mod n).

8. Let m, n be positive integers, and let f : Zm → Zm be the function

defined by f (x) = nx (mod m). Prove that f is one-to-one if and only
if gcd(m, n) = 1.

9. Find the inverse of 13 modulo 47.

10. Solve the congruence 2x ≡ 7 (mod 17).

1
Instructions on how to solve, write, and sub-
mit your homework assignment
Solving Solutions to homework assignments must be your own. Use sample
exercises in lectures and tutorials to learn methods and approaches you can
use. In some cases expect that you will need to make a substantial effort to
solve a problem. Discussing and collaborating with other people is OK, as
long as you produce your own solution. For instance, even when two people
try to solve the problem together and extensively discuss possible solutions,
if they write down that solution independently, it is acceptable.
We treat any kind of academic dishonesty very seriously. For the SFU
policy on academic dishonesty see the part of University Policy S 10.01 rel-
evant for us:

e. Cheating in assignments, projects, examinations or other forms

of evaluation by:
i. using, or attempting to use, another student’s answers;
ii. providing answers to other students;
iii. failing to take reasonable measures to protect answers from
use by other students; or
iv. in the case of students who study together, submitting iden-
tical or virtually identical assignments for evaluation unless per-
mitted by the course Instructor or supervisor.
University Policy S 10.01
Code of Academic Integrity and Good Conduct
4.1.2 Forms of Academic Dishonesty

Note that this policy treats copying and allowing to copy equally. Should
anyone be caught submitting a work too similar to someone else’s work, or a
source found on the web, a record of the violation will permanently stay in
their student file.

Writing a solution There is no strict prescribed way to present your so-

lution. However, make sure that your solution can be understood by another
person without any help on from you. The onus to present your solution in a
clear understandable way is on you. Any unclear steps or arguments will be
considered incorrect. For example, if you transform a propositional formula
using laws of logic, it is advisable to specify which law is applied, except in

2
the simplest situations. If you use some method, or result presented in this
course you do not need to explain it. However, if you would like to use a
result or approach from elsewhere, please, give a reference and explain what
you are doing in more details.

Submitting your solution Please use Crowdmark tool to submit your

work. If you typed your solution, upload a pdf. If you wrote it on paper,
scan or take a picture. In the latter case make sure your scan or picture is
clear with good lighting and good resolution. Also note that you can only
submit one file, so you may need to combine several pictures.
The onus to submit a readable file timely is on you. Submitting after
the deadline will cause a late submission penalty. Also, there will be no
submission after I post solutions to the homework (about 3 days after the
deadline).
Sometimes uploaded files get corrupt, please, double check that your up-
loads are readable. You can also bring a hard copy of your solution to the
class (on Friday) along with Crowdmark submission.