MATH 145 Review Session Kareem Alfarra

Rings

1. A ring homomorphism is a map φ : R1 → R2 such that

φ(ab) = φ(a)φ(b) (1)

φ(a + b) = φ(a) + φ(b) (2)

φ(1R1 ) = 1R2 (3)

φ(0R1 ) = 0R2 (4)

(5)

∀a, b ∈ R1 . If φ : R → R is a ring homomorphism, then it is called a ring endomorphism, if it is

a bijection then it is called an automorphism. Take ψ ∈ Aut(R) (the automorphisms of the real

numbers R). Show the following

(a) ψ|Q = 1Q , the identity map

(b) For a, b ∈ R, a < b =⇒ φ(a) < φ(b) (Hint: it suffices to show φ(b − a) > 0!)

(c) Show that ψ = 1R =⇒ Aut(R) = {1}

2. Let R be a commutative ring with a, b ∈ R. If a is a unit and b2 = 0, prove that a + b is a unit.

(Hint: if R is commutative then (a − b)(a + b) = a2 − b2 )

3. An element a ∈ R is called nillpotent if ak = 0 for some k ∈ N. Show that if a is nillpotent then

1 − a and 1 + a are units of R

1
MATH 145 Review Session Kareem Alfarra

Order and Induction

1. Consider the Fibonnaci Sequence given by F0 = 1, F1 = 1 and Fn = Fn−1 + Fn−2 , ∀n ≥ 2. Let

√ √
5+1 1− 5
τ= 2 and σ = 2 . Prove by induction that

τ n − σn
Fn = √
5

(Hint: We have τ 2 = τ + 1, σ 2 = σ + 1)

2. Show that Z with the usual order is not well ordered. Then show that Q≥0 with the usual order is

not well ordered as well.

2
MATH 145 Review Session Kareem Alfarra

Number Theory
n
1. The Fermat numbers are Fn = 22 + 1. Show that Fn have no common prime factors. Hence giving

another proof of the infinitude of primes. (Hint: For m ∈ N, show we have Fn = F0 . . . Fn−1 + 2)

2. Show that if x, y are coprime, then if xy is a k th power then x, y are k th powers.

3. prove that the equation x3 = 2y 3 + 4z 3 has no non-trivial integer solutions.

4. The Möbius function is defined as follows


(−1)m , if n is the product of m distinct prime factors


µ(n) =

0, otherwise


Prove that 

X 0, n > 1

µ(d) =

d|n 1, n = 1


(Hint: you can use unique factorization alongside binomial theorem to tackle this problem)

5. the integers mod m form a ring with the usual addition and multiplication. Find and prove sufficient

and necessary conditions for an element to have a multiplicative inverse in this ring. Then for the

following integers determine if they are units and if so find their inverses

(a) 100 in the ring of integers modulo 21

(b) 323 in the ring of integers module 34

3
MATH 145 Review Session Kareem Alfarra

Binomial Theorem
n


1. Prove that for any n ∈ N, if n | m for 1 ≤ m ≤ n − 1, then n is a prime.

n


Proof. We will show the contrapositive, that is if n is composite then n ∤ m for some 1 ≤ m ≤ n−1.

In particular for n = pe11 . . . pekk we will show that n ∤ pni .

Assume for contradiction that it does, then we consider n = pe11 . . . pekk = mpe11 . Then we have
e1
n n! n (n−1)...(n−p1 +1) e1


p11 = pe11 !(n−pe11 )! = pe11 (pe11 −1)...(2)(1) . We observe the second fraction does not have p1 as
e

e
(n−1)...(n−p11 +1)
Since n | pne1 =⇒ p1 | pne1 =



a factor, so we can rewrite it as follows m · (pe1 −1)...(2)(1)
1 1 1
e
(n−1)...(n−p11 +1)
m· e
(p11 −1)...(2)(1)
, then p | m, a contradiction, thus we get our desired result. ■

2. Show the following identity

k    
X n+i n+k+1
=
i=0
i k

Proof. Induction here can be used easily for the case that k = 0, 1 it is obvious. Then we proceed

consider k + 1 and then we have

k+1
X  k    
n+i X n+i n+k+1
= +
i=0
i i=0
i k+1
   
n+k+1 n+k+1
= +
k k+1
(n + k + 1)! (n + k + 1)!
= +
(n + 1)!k! n!(k + 1)!
k + 1(n + k + 1)! n + 1(n + k + 1)!
= +
(n + 1)!(k + 1)! (n + 1)!(k + 1)!
(n + k + 1)!(n + 1 + k + 1)
=
(n + 1)!(k + 1)!
(n + k + 2)!
=
(n + 1)!(k + 1)!
 
n+k+2
=
k+1

3. Let n be an odd integer greater than 1. Show that there is an odd number of odd integers in the

following Sequence
     
n n n
, , . . . , n−1
1 2 2

4. (might be a bit hard) Consider the term (x1 + x2 + x3 )n , then consider (x1 + · · · + xk )n . Does

there exist a generalization of the binomial theorem for more than two elements? Come up with a

conjecture and prove it!