Scribd
Upload
6 views2 pages

MATH 135 F24 EPQuiz1

Uploaded by

danielhu268
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views2 pages

MATH 135 F24 EPQuiz1

Uploaded by

danielhu268
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

MATH 135: Extra Practice for Quiz 1 (Sections 6.1-6.

5)

These problems are for extra practice and are not to be handed in. Solutions will not be posted but, unlike
assignment problems, they may discussed in depth on Piazza.

• The warm-up exercises are intended to be fairly quick and easy to solve. If you are unsure about any
of them, then you should review your notes and possibly speak to an instructor before beginning the
recommended problems.

• The recommended problems are intended to help you prepare to write your quizzes. Try writing
solutions to these problems using only the posted reference sheet for the corresponding quiz as an
aid.

• At least one more challenging extra problem is also included for students wishing to push themselves
even harder. Do not worry if you cannot solve these more difficult problems. Their difficulty is
beyond the difficulty of the quizzes.

Warm-up Exercises

1. What is the remainder when −98 is divided by 7?

2. Calculate gcd(10, −65).

3. Let a, b, c ∈ Z. Consider the implication S: If gcd(a, b) = 1 and c | (a + b), then gcd(b, c) = 1. Fill in
the blanks to complete a proof of S.

(a) Since gcd(a, b) = 1, by there exist integers x and y such that ax + by = 1.


(b) Since c | (a + b), by there exists an integer k such that a + b = ck.
(c) Substituting a = ck − b into the first equation, we get 1 = (ck − b)x + by = b(−x + y) + c(kx).
(d) Since 1 is a common divisor of b and c and −x + y and kx are integers, gcd(b, c) = 1 by
.

4. Disprove: For all integers a, b and c, if a | (bc), then a | b or a | c.

Recommended Problems

5. (a) Use the Extended Euclidean Algorithm to find three integers x, y and d = gcd(1112, 768) such
that 1112x + 768y = d.
(b) Determine integers s and t such that 768s − 1112t = gcd(768, −1112).

6. Prove that for all a ∈ Z, gcd(9a + 4, 2a + 1) = 1

7. Let a, b ∈ Z. Prove that if gcd(a, b) = 1, then gcd(2a + b, a + 2b) ∈ {1, 3}.

8. Prove that for all integers a, b and c, if a | c and b | c and gcd(a, b) = 1, then ab | c.

9. Let a, b, c ∈ Z. Prove that if gcd(a, b) = 1 and c | a, then gcd(b, c) = 1.

10. Suppose a, b and n are integers. Prove that n | gcd(a, n) · gcd(b, n) if and only if n | ab.

11. Let gcd(x, y) = d for integers x and y. Express gcd(18x + 3y, 3x) in terms of d and prove that your
expression is in fact correct.
Challenge(s)

12. (a) Let n be a positive integer for which gcd(n, n + 1) < gcd(n, n + 2) < · · · < gcd(n, n + 20).
Prove that gcd(n, n + 20) < gcd(n, n + 21).
(b) Let n be a positive integer for which gcd(n, n + 1) < gcd(n, n + 2) < · · · < gcd(n, n + 6).
Does it follow that gcd(n, n + 6) < gcd(n, n + 7)?

13. Let a and b be nonnegative integers. Prove that gcd(2a − 1, 2b − 1) = 2gcd(a,b) − 1.

14. An integer n is perfect if the sum of all of its positive divisors (including 1 and itself) is 2n.

(a) Find all perfect numbers which are at most 30.


(b) Prove the following statement:
If k is a positive integer and 2k − 1 is prime, then 2k−1 (2k − 1) is perfect.

You might also like