MATH 354 PSet 1

Andrew Hu
Number Theory
January 21, 2015
Survey
1. Andrew Hu
2. andrew.hu@yale.edu
3. 2016, Pierson College (PC)
4. Economics; Computer Science & Math
5. Silver Spring, MD
6. Club Muay Thai, Club Wrestling, Club Jiu Jitsu, Behavioral Economics Research (hopefully)
7. MATH 230, 231, 244, 350, 370, 310, 353
8. No direct experience aside from coming upon it in contest math in high school.
9. 0. Its pretty simple.

MATH 354: PSet 1

Andrew Hu

Problem 1. Greatest Common Divisor

Let S = {x|x Surgeons} B A A B
Assume, by way of contradiction, that gcd( Ad , Bd ) = c > 1. This means Ad = cx and Bd = cy
for some integers x, y Z. Then, we may write A = dcx, B = dcy so gcd(A, B) cd,
contradicting maximality of d. Therefore, gcd( Ad , Bd ) = 1.
u, v Z have some greatest common divisor d. Let r = u/d, s = v/d. Then, by the above,
r, s are coprime. Since the above expressions are uniquely determined by u, v, d, this is a
unique way of expression u/v as r/s for coprime r/s.
Problem 2. Projective Spaces
Nathanson 1.2 Exercise 15
Let (x0 , x1 , . . . , xn ) S. Then, if we let t = 1, we have x x.
Let (y0 , y1 , . . . , yn ) S and suppose x y. Then, there exists a t Q, t 6= 0 such that
txi = yi for i = 0, . . . , n. Take t0 = 1/t and note t0 yi = xi for i = 0, . . . , n and therefore
y x.
Let (z0 , z1 , . . . , zn ) S and suppose x y, y z. Therefore, there exists a nonzero t, s Q
s.t. txi = yi , syi = zi for i = 0, . . . , n. Then, let r = st and we may write stxi = xyi = zi for
i = 0, . . . , n so x z. Therefore is an equivalence relation.
Nathanson 1.2 Exercise 16
The relationship allows us to multiply by any scalar. Let us first make all the coordinates
integers by multiplying by 6, giving us (25, 30, 20). Now, we divide by 5, giving us (5, 6, 4)
which is relatively prime. There is one more (5, 6, 4) (obtained by multiplying by 1).
To see that these two are all of them, see Exercise 17.
Nathanson 1.2 Exercise 17
We first need to prove there exists non zero t Q s.t. txi = ai for i = 0, . . . , n. We proceed
as above: Each xi can be written as ri /si for ri , si are relatively prime. Let s be the least
common multiple of the si . Let d be the gcd of sri /si , which is an integer. Now, let t = s/d.
Define ai = txi . By construction, ai are indeed integers and are relatively prime. Then,
consider bi = ai . Since the bi are also integers and relatively prime, they also satisfy our
conditions.
It remains to show that this construction of ai and bi
another set of relatively prime integers ci where there
txi = ci . Since this c is in the same equivalence class
ci = wai . Unless w is 1 or 1 (in which case c = b),
Therefore, a and b are the only two such elements.
Problem 3. Combinatorics

is exhaustive. Suppose there was

existed some non-zero t Q s.t.
of a, then c must be of the form
the ci cannot be relatively prime.

MATH 354: PSet 1

Andrew Hu

a. Using Theorem 1.12, for any prime p, we may write:

n
[ log
]
log p 

n
pr

ordp (n!) =

r=1

k
[ log
]
log p

X k
ordp (k!) =
pr
r=1
[

ordp ((n k)!) =

log(nk)
]
log p

X  (n k) 
pr
r=1

k
]
[ log
log p 

ordp (k!(n k)!) =

X
r=1

]
 [ log(nk)

log p
X
k
(n k)
+
pr
pr
r=1

Without loss of generality, let k < n k. We may continue the above:

k
]
[ log
log p 

ordp (k!(n k)!) =

X
r=1

]
 [ log(nk)

log p
X
k
(n k)
+
pr
pr
r=1

log(nk)
]
log p

log(nk)
]
log p

log(nk)
[ log p ] 

X k
X
(n k)
+
pr
pr
r=1
r=1

X n
pr
r=1

n
]
[ log
log p 


n
= ordp (n!)

pr
r=1


Therefore, for any prime p, the denominator of nk has fewer than the numerator in their
prime factorizations and the binomial coefficient is an integer.
X

b. Using the above, let us consider ordp . We have:

log p
[ log
]
p 

ordp (p!) =

X
r=1

k
[ log
]
log p 

ordp (k!(p k)!) =

X
r=1


p
=1
pr


k
+
pr

log(pk)
]
log p

X  (p k) 
pr
r=1

Since k and p k are necessarily < p,

both the terms in the second equation are 0 so
p
ordp (k!(n k)!) = 0. Therefore, ordp ( k ) = 1 for k = 1, . . . , p 1 so the binomial coefficient
is divisible by p.
3

MATH 354: PSet 1

Andrew Hu

Problem 4. Polygons - Exercise 1.12 I+R

There are 360 degrees about a vertex. To fit evenly about a common vertex, the regular
polygons must have interior angles that divide 360. The regular polygons have the following
interior angles: 60 (triangle), 90 (square), 108 (pentagon), 120 (hexagon), etc. From this
list, only 6 triangles, 4 squares, or 3 hexagons can be fitted as so. Furthermore, there are
no others as the next angle that divides 360 is 180, and no regular polygon has that interior
angle.
Problem 5. Squares - Exercises 1.16, 1.17 I+R
I+R 1.16
Q
Q
We may write them as u = (1)(u) p,ordp (u)>0 pordp (u) and v = (1)(v) q,ordq (v)>0 q ordq (v) .
Since (u, v) = 1, the list of primes p and q must be distinct. Since uv = a2 , in the product,
the exponent on each prime must be even. Putting these facts together, u and v must each
be squares.
I+R 1.17
Suppose there was some number q = r/s s.t. q 2 = 2 and (r, s) = 1; this existence is
guaranteed by a previous result. Then, we may write r2 = 2s2 . This implies that r2 has a
factor of 2 and so must r. We write r as 2t and rewrite the equation as 4t2 = 2s2 = 2t2 =
s2 , which impliess2 and s have a factor of 2 in it. This contradicts (r, s) = 1, thus, no such
q can exist and 2 is irrational
Problem 6. Generating Pythagorean Triples - Exercise 1.23 I+R
Without loss of generality, let a be even and b, c odd. We write a2 = c2 b2 . Then, by
exercise 1.10, we know (c, b) = 1 = (c + b, c b) = 1, 2. Since a2 is even, (c + b, c b) = 2.
Then, by Problem 1 and Problem 5 above, we know c + b and c b must be of the form
2u2 and 2v 2 . And since (c + b, c b) = 2, this means (u, v) = 1. For the converse, we check
a2 + b2 = c2 = 4u2 v 2 + (v 2 u2 )2 = (v 2 + u2 )2 = 0 = 0, which is true.
Problem 7. Fractions - Exercise 1.30 I+R
Let 2a be the largest power of 2 not exceeding n. Let P be the product of the odd positive
integers not exceeding n. Now, consider the number 2a1 P hn . We will prove for every integer
k < n and k 6= 2a , k is a factor of 2a1 P . If k is odd, this is trivial by definition of P . If
k is even, then we claim k is of the form 2b c where c is the product of odd numbers and
b a 1. This is true by construction of choice of a (for is k = 2a c, then k > 2a+1 > n,
which is impossible). Therefore, k is again a factor of 2a1 P . Thus, the expression 2a1 P hn ,
after multiplying through term by term of hn , is the sum of a bunch of integers + P/2
(corresponding to the 1/2a term). Since this is a non-integer, this implies hn must also be a
non-integer.
Problem 8. Quadratic
Field 2 2

a. z z = (a + b d)(a b d) = a b d = N (z) and z + z = a + b d + a b d = 2a = T (z).

b. Let = x + y d and = w + z d. Then T ( + ) =T (x + w + (y + z) d) = 2x + 2w =

T () + T (). Also, N ( ) = N (xw + yzd + (xz + yw) d) = (xw + yzd)2 d(xz + yw)2 =
x2 w2 + y 2 z 2 d2 x2 z 2 d y 2 w2 d = (x2 dy 2 )(w2 dz 2 ) = N ()N ().

MATH 354: PSet 1

Andrew Hu

c. If is a unit, then |1. There is some c Z[ d] s.t. c = 1. Then 1 = N (1) =

N (c)N () = 1. Since both norms are integers, N () = 1.

d. Let = a +b d. We check 2 T () + N () = 2 2a + a2 db2 = a2 + 2ab d +

b2 d 2a(a + b d) db2 = 0.
Problem 9.Quadratic Field

a. Let = 3 5 and
Then, any remainder will be of the form 3 5 2 for some
= 2.
non-zero = a + b 5 Z[ 5]. Then, this remainder will have norm 4a2 + 5(2b 3)2 .
Since |2b 3| 1 for b Z, the norm of the remainder is 5 which is greater than N () = 4.

b. 3 7 = 21, (1 + 2 5)(1 2 5) = 1 + 20 = 21. To prove each factor

is irreducible,
we shall assume,
by
contradiction,
that
they
factor
into

for
,

Z[
5]. We write

2
2
2
= a + b 5, = c + d 5. For 3, this would imply that (a + 5b )(c + 5d2 ) = 9; WLOG
a2 + 5b2 = 1, 9 implies or is aunit and a2 + 5b2 = 3 has no integer solutions. 7 has
an analogous argument. For 1 + 2 5, the above would imply (a2 + 5b2 )(c2 + 5d2 ) = 21;
2
2
2
2
WLOG
a + 5b = 1, 21 implies or is a unity; and a + 5b = 3, 7 has no integer solutions.
1 2 5 has an analogous argument.
Since units must have
norm 1, theonly units in this ring are 1 and therefore, 3 and 7 are
not associates of 1 + 2 5, 1 2 5.
Problem
10. Another ring

Z[ 2] is an Abelian group under addition, defined by (a+b 2)+(c+d 2) = (a+c)+(b+

2
d) 2 which can be seen as considering
addition
as coordinate wise addition
Under

in Z .

multiplication defined by (a + b 2)(c + d 2) = ac 2bd + (ad + bc) 2 Z[ 2],

it is associative (by associativity of integer multiplication). The identity is simply 1 and
distributive property holds. Therefore, it is a ring.

First, let Z[ 2]. Compute

= (a + b 2i)(a b 2i) = a2 + 2b2 . Note that
() = a2 + 2b2 =
.

/
= r + s 2 where we use
Let = a + b 2, = c + d 2 and 6= 0.Then / =
the fact that
= () Z+ and
Z[ 2] by ring property. Find integers m, n s.t.
1
1
|r m| 2 and |s n| 2 . Then, = m + n 2. ((/) ) = (r m)2 + 2(s n)2 < 1.
Let = . Then either
= 0 or () = (((/) )) = ()((/) ) < ()

as needed. Therefore Z[ 2] is a Euclidean domain.