Scribd
Upload
1 views

MAT422_Assignment_01

The MAT422 Assignment 01 consists of various mathematical problems related to number theory, including factorization techniques, the Euler product formula, square-free integers, and properties of the Euler totient function. The assignment is due on March 18th, 2025, and includes proving theorems and applying methods such as Euler's method and the Chinese Remainder Theorem. Each problem has specific points assigned, totaling 100 points for the assignment.

Uploaded by

Aer As
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
1 views

MAT422_Assignment_01

The MAT422 Assignment 01 consists of various mathematical problems related to number theory, including factorization techniques, the Euler product formula, square-free integers, and properties of the Euler totient function. The assignment is due on March 18th, 2025, and includes proving theorems and applying methods such as Euler's method and the Chinese Remainder Theorem. Each problem has specific points assigned, totaling 100 points for the assignment.

Uploaded by

Aer As
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

MAT422 Assignment 01

Assignment is due March 18th, 2025 at 11:59 pm.

Problem 1 (5 + 4 + 3 + 3 = 15 points)
In this problem, we develop a factorization technique known as Euler’s method. It is applicable when the integer
being factored is odd and can be written as the sum of two squares in two different ways. Let n be an odd
integer such that
n = a2 + b2 = c2 + d2 ,
where a and c are odd positive integers, and b and d are even positive integers.
(a) Let u = gcd(a − c, b − d). Show that u is even and that if

a−c d−b
r= and s = ,
u u
then
gcd(r, s) = 1, r(a + c) = s(d + b), and s | (a + c).

(b) Let s v = a + c. Show that


r v = d + b,
and that v is even.
(c) Conclude that n may be factored as
   v 2 
u 2
n= + (r2 + s2 ).
2 2

(d) Use Euler’s method to factor 221 and 2501.

Problem 2 (7 + 2 + 3 = 12 points)
In this problem, we discuss how the method of sieves can be used to arrive at the Euler product formula. For
a finite set of primes P , define    
 Y 
R(P ) = n ∈ N : gcd n, p = 1 ,
 
p∈P

and let X 1
ζP (s) = .
ns
n∈R(P )

(a) Show, via a counting argument, that


Y 1

ζP (s) = ζ(s) 1− s .
p
p∈P

(b) Explain why, as P increases to include all primes, the sum on the left-hand side converges to 1, and use
this to derive the Euler product formula.
π2
(c) It is a well-known result that ζ(2) = 6 . Explain how this result can be used to conclude that there are
infinitely many primes.

1
Problem 3 (10 points)
An integer n is said to be square-free if its prime factorization is of the form

n = p1 p2 · · · pr ,

where p1 , p2 , . . . , pr are distinct primes. Show that for all real s > 1,

ζ(s) X 1
= ,
ζ(2s) ns
n∈S

where ζ(s) is the Riemann zeta function, and S is the set of positive square-free integers.

Problem 4 (12 points)


Let p1 , p2 , . . . , pt be primes and consider the set
na o
R= ∈ Q : a, b ∈ Z and ordpi (a) ≥ ordpi (b) for i = 1, 2, . . . , t .
b
Prove that R is a ring. Note: Here, ordp (x) denotes the exponent of p in the prime factorization of x (with the
convention that ordp (0) = ∞).

Problem 5 (4 + 8 = 12 points)
(a) Show that every prime number p > 3 is congruent to ±1 modulo 6.
(b) Use part (a) to show that there are infinitely many primes congruent to −1 modulo 6.

Problem 6 (10 points)


Use Wilson’s theorem to find the remainder of 51! when divided by 61. You may use, without proof, that 34 is
the multiplicative inverse of 9 modulo 61 i.e. 9 × 34 ≡ 1 (mod 61).

Problem 7 (7 + 8 = 15 points)
The Chinese Remainder Theorem states that if m1 , m2 , . . . , mk are pairwise coprime positive integers, then for
any integers a1 , a2 , . . . , ak , the system of congruences

x ≡ ai (mod mi ), for i = 1, . . . , k,

has a unique solution modulo M = m1 m2 · · · mk .


(a) Prove the Chinese Remainder Theorem by constructing the unique solution modulo M .
(b) Prove that the above statement is equivalent to the ring isomorphism

Z/(M Z) ∼
= Z/m1 Z × Z/m2 Z × · · · × Z/mk Z.

Problem 8 (4 + 4 + 6 = 14 points)
Prove the following properties of the Euler totient function:
(a) If a | b, then ϕ(a) | ϕ(b).
(b) For any positive integers m and n,
d
ϕ(mn) = ϕ(m)ϕ(n) ,
ϕ(d)
where d = gcd(m, n).
(c) Prove that ϕ(n) is even for all n ≥ 3. Moreover, if n has r distinct odd prime factors, then 2r divides
ϕ(n).

You might also like