Section 1.6
Exercises
Choose one of the questions from:
Determine the gcd of each of the following pairs of numbers, and write the gcd as a linear combination of the given numbers:
Show that, for all positive integers x, y, z,
Let a, b be distinct integers.
Prove that there exist infinitely many primes of the form 4n + 3.
If c is a common multiple of a and b, then c is a multiple of lcm(a,b). Prove this.
For which positive integers n is n2 - 1 prime?
Which integers of the form 13p + 1 (with p prime) are squares of integers?
Prove: If a and b are integers, not both zero,
and c = gcd(a,b), then
c = min{xa + yb | xa + yb > 0, x,
y
Z}.
Prove that the cube root of 17 is not a rational number.
Find the factorization of 232 - 1.
For any positive integer n divide 103n by 10n - 1 and find the remainder.
Three cogwheels with 24, 15 and 16 cogs, respectively, touch as shown in the picture.

Prove that the square of an odd integer is again odd, where `odd' means `not divisible by 2' or, equivently, `leaving remainder 1 upon division by 2'. Show that the remainder of division by 4 of the square of an odd integer is 1. Does the last statement hold if we replace 4 by 8? And by 16?
Prove each of the following statements.
Let a be a rational number such that both 18a and 25a are integers. Show that a itself is an integer.
Find all integers x and y such that 32x + 10y = 6.
Find all primes p and q such that 4p + 7q = pq.