EXERCISE SET 1

(1) Let x > 0 be such that x + 1x is an integer (x itself doesn’t have to be an integer). Prove that
x n + x1n is an integer for every natural n. (Hint: Use induction).
(2) Prove that there are infinitely many prime of the form p = 4m + 3. (Hint: Show that every
number of the form 4m + 3 must have a prime divisor of the same form, and mimic Euclids
proof of infinitude of primes).
(3) Find the gcd of 42823 and 6409. How many step do you need to get this gcd? Moreover, find
integers x and y such that the gcd is equal to 42823x + 6409y.
(4) Are there integers x, y, z such that 6x + 10y + 15z = 1? If yes, find them.
(5) Prove that 4 - (n2 + 2) for any integer n.
(6) Prove that if the integers x, y are odd the x2 + y2 is even but not divisible by 4.
(7) Prove the following for any ingeger n:
(i) n2 − n is divisible by 2.
(ii) n3 − n is divisible by 6.
(iii) n5 − n is divisible by 30.
(Hint: do factorization of the corresponding expressions).
(8) For integers a, b, n > 1 show that ( an − bn ) doe not divide ( an + bn ). [Hint: ( an − bn ) divides
2an and also 2bn . Write kan = (k + 2)bn . Do it separately for even and odd k by assuming that
a and b are coprime.]
(9) Prove that n4 + 4 is a composite number for all integers n > 1.
(10) Show that there are no prime triplets, that is primes p, p + 2, p + 4, other than 3, 5, and 7.
(11) Find all prime p such that p2 + 1 is also prime.
(12) Find all prime p such that p2 + 2 is also prime.
(13) Suppose that 2n + 1 is a prime number. Show that n = 2k for some k.
(14) Prove that 7|(32n+1 + 2n+2 ) for all n.
(15) Calculate φ( pk ) where φ is Euler-phi function and p is a prime. Moreover, find out the num-
bers n, φ(n) is odd.
(16) Show that 2, 4, 6, · · · , 2m is a complete residue system modulo m if m is odd. Moreover,
12 , 22 , · · · , m2 is not a complete residue system modulo m if m > 2.
(17) Show that if p is a prime then ( p−k 1) ≡ (−1)k ( mod p) for 0 ≤ k ≤ p − 1.
(18) Let a, b ∈ Z such that each a and b are sum of two integers. Show that ab is also sum of two
squares.
(19) (The number of solutions is number of solutions modulo p) Prove that the solution of x2 ≡ 1(
mod 2k ) has one solution (1 is the solution) if k = 1, two solutions (1 ans -1 are the solutions)
if k = 2 and four solutions (±1, pk−1 ± 1) if k ≥ 3.
(20) Let p be a prime different from 2. Prove that
x2 ≡ 1( mod pk ) ⇔ x ≡ ±1( mod pk )

Date: July 26, 2018.

1