You are on page 1of 1

January 16, 2019 MATH3304 Intro.

to Number Theory

Homework 1

Problem 1. (20 points) Show that every number of the form x3 + 4x − 1 with x ∈ Z is of the
form 11k + 1, 11k + 2, 11k + 4, 11k + 5, 11k + 7, 11k + 8, or 11k + 10 for some k ∈ Z. In
particular, x3 + 4x − 1 is never a multiple of 11.
Problem 2. (20 points) Show that for every x ∈ Z there exists m ∈ N0 such that gcd (x2 − x +
1, x4 − 1) = 3m .
Problem 3. (20 points) Let a1 , . . . , an for n ≥ 2 be nonzero integers. Suppose that there exist
a prime p, a positive integer h, and an index 1 ≤ i ≤ n such that ph | ai for some i and ph does
not divide aj for all j 6= i. Then show that
1 1
S= + ··· +
a1 an
is not an integer.
Problem 4. (20 points) Prove that every positive integer of the form 3k + 2 has a prime factor
of the form 3m + 2 for some m.
Problem 5. (20 points) Does there exist a pair of integers (x, y) such that x + y = 100 and
gcd(x, y) = 3? Justify your answer.

Due date: Please place the assignment in the assignment box by Wednesday, January 30, 2019
at 19:00.
Please write your name and UID on your solutions!

You might also like