Scribd
Upload
3 views2 pages

Mas210 HW1

This document is an assignment for the Introduction to Number Theory course (MAS210) due on March 12, 2023, at noon. It includes instructions for submission, problems related to greatest common divisors, and properties of complex numbers in a specific set. Students are required to show all intermediate steps and computations in their solutions.

Uploaded by

amin1jafarzade
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views2 pages

Mas210 HW1

This document is an assignment for the Introduction to Number Theory course (MAS210) due on March 12, 2023, at noon. It includes instructions for submission, problems related to greatest common divisors, and properties of complex numbers in a specific set. Students are required to show all intermediate steps and computations in their solutions.

Uploaded by

amin1jafarzade
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

INTRODUCTION TO NUMBER THEORY (MAS210) ASSIGNMENT #1

INSTRUCTOR: WANSU KIM

Instructions.
• This assignment is due on 12th March (Wednesday) at 12pm (noon).
본 과제 제출기한은 3월 12일 수요일 오후 12시(정오)입니다.
• Please submit a soft copy via KLMS. A scanned copy is acceptable, provided
that it is clearly legible. If you choose to TEX your solutions, please submit
both the .tex and .pdf files for plagiarism checks.
KLMS 과제를 통하여 답안을 업로드해 주시기 바랍니다. (글씨를 명확히 식별
할 수 있는) 스캔 파일을 제출하실 수 있고, 또한 TEX을 사용하여 답안을 작
성하고 싶으시다면 표절 체크를 위하여 .tex 파일과 .pdf 파일을 같이 제출해
주시기 바랍니다.
• Please show all the intermediate steps and computations.
중간과정 및 계산을 모두 보여주시기 바랍니다.

1. Let a and b be non-zero integers, and let g be a common divisor of a and b.


(1) Prove, just using the definition of gcd(a, b), that g = ± gcd(a, b) if any com-
mon divisor d of a and b divides g.
(2) Prove the converse of the above statement; namely, if g = ± gcd(a, b) then
any common divisor d of a and b divides g.
(3) Prove that g = ± gcd(a, b) if and only if 1 = gcd( ag , gb ).

2. For each integer triple (a, b, c) below, (a) compute gcd(a, b) by Euclid’s algorithm,
(b) determine if aX + bY = c has an integer solution, and (c) determine all integer
solutions of aX + bY = c if there exist. (Please show your work. You do not need to
simplify the final answer.)
(1) a = 70, b = 21, c = 14.
(2) a = 395, b = 72, c = 1.
(3) a = 2021, b = 361, c = gcd(a, b).

3. Let n ⩾ 2 be an integer, and let a1 , · · · , an be non-zero integers. Then we define


the greatest common divisor gcd(a1 , · · · , an ) as follows:

gcd(a1 , · · · , an ) := max{d such that d|a1 , · · · , d|an }.

Note that this notion is consistent with the usual definition of gcd when n = 2.
1
2 INSTRUCTOR: WANSU KIM

(1) Prove that


  
gcd(a1 , · · · , an ) = gcd · · · gcd gcd(a1 , a2 ), a3 , · · · , an .
| {z }
(n−1) times

Hint: Start with the case n = 3 and show gcd(a1 , a2 , a3 ) = gcd(gcd(a1 , a2 ), a3 ).


Then from this case, try to figure out how to proceed by induction on n.
(2) Let b be a non-zero integer. Then state and prove the condition on b under
Pn
which the equation i=1 ai Xi = b has an integer solution. Or equivalently,
Pn
explicitly describe the set { i=1 ai ui | ui are integers ∀i}.
Hint: The condition on b will be in terms of gcd(a1 , · · · , an ).

4. Let R ⊂ C be the set of complex numbers given as follows


 √
R := a + b −5 | a, b integers .

(1) Show that τ · τ̄ is an integer for any τ ∈ R.


(2) For any non-zero τ ∈ R, show that its complex inverse τ −1 is in R if and
only if τ = ±1.
(3) Show that if we have z · w = 2 or 3 for some z, w ∈ R, then we have either
z = ±1 or w = ±1.
√
(4) Show that if we have z · w = 1 ± −5 for some z, w ∈ R, then we have
either z = ±1 or w = ±1.

You might also like