Math 51/COEN 19

Number theory vocab Let a, b Z, a ≠ 0. We say that a divides b and write a|b if m Z such that b = ma (ie b is a multiple of a)

Number theory vocab Let a, b Z, a ≠ 0. We say that a divides b and write a|b if m Z such that b = ma (ie b is a multiple of a) Theorem: Let a, b, c, Z with a, b ≠ 0 – i. If a|b and a|c then a|(b+c) and a|(b-c) – ii. If a|b then a|bc – iii. If a|b and b|c then a|c – iv. If a|b and a|c then a|mb+nc whenever m, n Z

Number theory vocab Let a, b Z, a 0. We say that a divides b and write a|b if m Z such that b = ma (ie b is a multiple of a) Theorem: Let a, b, c, Z with a, b 0 – i. If a|b and a|c then a|(b+c) and a|(b-c) – ii. If a|b then a|bc – iii. If a|b and b|c then a|c – iv. If a|b and a|c then a|mb+nc whenever m, n Z Division algorithm: Let a Z and d Z +. Then there are unique integers q and r such that a = qd+r and 0 ≤ r<d

Number theory vocab Division algorithm: Let a Z and d Z +. Then there are unique integers q and r such that a = qd+r and 0 ≤ r<d Let m Z, m ≥ 2. If a, b Z and m|(a-b) we write (a ≡ b)mod m (ie a and b differ by a multiple of m)

Number theory vocab Division algorithm: Let a Z and d Z +. Then there are unique integers q and r such that a = qd+r and 0 ≤ r<d Let m Z, m ≥ 2. If a, b Z and m|(a-b) we write (a ≡ b)mod m (ie a and b differ by a multiple of m) Theorem: Let a, b, m Z, m ≥ 2. If (a ≡ b)mod m then i)(b ≡ a)mod m ii) (a ≡ a)mod m iii) if (a ≡ b)mod m and (b ≡ c)mod m then (a ≡ c)mod m (prove in HW)

Which are congruent to each other mod 5?

Theorem: if (a ≡ b)mod m and (c ≡ d)mod m then (a+c ≡ b+d)mod m and (a-c ≡ b-d)mod m and (ac ≡ bd)mod m (won’t prove)

Let n Z. i) n is even iff (n ≡ 0)mod 2 ii) n is odd iff (n ≡ 1)mod 2