You are on page 1of 7

W2 Divisibility Jan 18

1. a) Show that (Z, +, ·) is an Euclidean Domain.


b) Show that (Z, +, ·) is a Principal Ideal Domain (PID).
c) Show that (Z, +, ·) is a Unique Factorization Domain (UFD).
2. Let Sn (k) = 1k + 2k + · · · + nk .
n(n + 1) n(n + 1)(2n + 1)
a) Show that Sn (1) = , Sn (2) = , Sn (3) = Sn (1)2 .
2 6
b) Prove that Sn (2k + 1) is divisible by Sn (1).
n2 (n + 1)2 (2n2 + 2n − 1)
c) Prove that Sn (5) is divisible by Sn (3). (Hint Sn (5) = )
12
3. a) Solve the Diophantine equation x2 + y 2 = z 2 where (x, y) = (y, z) = (z, x) = 1.
b) Show that if the positive integers x, y satisfy 2x2 +x = 3y 2 +y then x−y, 2x+2y+1, 3x+3y+1
are perfect squares.
c) Find all integral solutions of 2x2 + x = 3y 2 + y.
4. a) Show that if a = bq + r then (a, b) = (b, r).
b) Compute gcd(21n + 4, 14n + 3), gcd(12n + 1, 30n + 2), (n2 + 1, n + 1).
c) Compute (Fn , Fn+1 ) where Fn is a Fibonacci number.
d) Compute (Sn (2007), n + 2).
e) Let An = 23n + 36n+2 + 56n+2 . Compute (A0 , A1 , · · · , A1999 ).
5. a) Decompose 11! into primes.
b) How many positive divisors 11! has?
c) Decompose 21! into primes.
d) Show that n!(n + 1)! |(2n)!.
6. Let f : R → Z defined by f (a) = [a].
a) Compute f (5.4), f (−3.2).
b) Prove that f (a + n) = f (a) + f (n) where n ∈ Z.
c) Prove that f (2a) = f (a) + f (a + 21 ).
P2008 2k + 2008
d) Compute k=0 [ ].
2k+1
7. a) Show that (Z[i], +, ·) is an Euclidean Domain.
b) Show that (Z[i], +, ·) is a Principal Ideal Domain (PID).
c) Show that (Z[i], +, ·) is a Unique Factorization Domain (UFD).
8. Show that every primitive Pythagorean triple (a, b, c) where a is odd are described by the
parametric formula
a = m2 − n2 b = 2mn c = m2 − n2
where m > n > 0, (m, n) = 1, and m − n is not divisible by 2.
9. Show that the integral solutions to a2 +b2 = c3 with (a, b) = 1 are described by the parametric
formula
a = m3 − 3mn2 b = 3m2 n − n3 c = m2 + n2
where (m, n) = 1, and m − n is not divisible by 2.

Homework: Chapter 1 Problems 1.2.1-1.2.20 (p25) and 1.4.1-1.4.15 (p37) (DQV) [Group 2]

You might also like