Algebra 2 Notes 1

Question 1

(1D-N1-1.1) Let a, b ∈ Z. Then a divides b if …

Answer 1

-

Question 2

(1P-N1-1.2) (i) If a|b and a|c then a|bd + ce, (ii) If a|b and b|c then a|c. (iii) if a, b ̸= 0 and a|b and b|a then a = ±b.

Answer 2

-

Question 3

(1D-N1-1.3) Factorisation: trivial, composite. Prime, units.

Answer 3

-

Question 4

(1T-N1-1.4) Division theorem

Answer 4

-

Question 5

(1D-N2-1.5) Highest Common Factor, Coprime

Answer 5

-

Question 6

(1T-N2-1.6) Euclid’s Algorithm

Answer 6

-

Question 7

(1D-N3-1.7) Linear Combinations

Answer 7

-

Question 8

(1T-N3-1.8) Let a, b be non-zero integers and x an integer. Then x is a linear combination of a and b if and only if hcf(a,b) | x.

Answer 8

-

Question 9

(1L-N3-1.9) the h-k Lemma’

Answer 9

-

Question 10

(1P-N3-1.10) Let p be a prime number and a and b be integers. Then p|ab ⇒ p|a or or p|b

Answer 10

-

Question 11

(1C-N4-1.11) Let p be a prime number and a1, a2, …, an be integers. Then if p divides a1a2…an, then p divides at least one of the ai.

Answer 11

-

Question 12

(1T-N4-1.12) Unique factorisation (in Z 2014)

Answer 12

-

Question 13

(1T-N5-1.14) Infinitely Many primes

Answer 13

-

Question 14

(1D-N6-1.15) Given R be a relation on a set X. Then Reflexive, Symmetric, Transitive

Answer 14

-

Question 15

(1D-N6-1.16) Equivalence Relation

Answer 15

-

Question 16

(1E-N6-1.17) Show R be defined on Z by xRy if y−x is a multiple of 3 is an ER. Then later different EC’s, Partitions

Answer 16

-

Question 17

(1D-N6-1.18) Equivalence Class

Answer 17

-

Question 18

(1P-N6-1.19) Let R be an equivalence relation on a set X. Then (i) [a] = [b] ⇔ aRb, (ii) [a] ∩ [b] = ∅ or [a] = [b]

Answer 18

-

Question 19

(1D-N7-1.20) A partition of a set X

Answer 19

-

Question 20

(1T-N7-1.21) Let R be an equivalence relation on a set X. Then the distinct equivalence classes form a partition of X, i.e

Answer 20

-

Question 21

(1R-N7-) Key notation

Answer 21

-

Question 22

(1T-N8-1.22) Let n be an integer ≥ 2. Then the relation on Z defined by aRb if b − a is a multiple of n is an equivalence relation. A set of representatives is given by 0,1,2,…n−1, i.e. Let Zn denote the set of equivalence classes. Then the operations defined by

Answer 22

-