1/17
yayayayayayaya
Division of Integers
Let a, b ∈ ℤ. We say a divides b (writen as a ∣ b) if there exists an integer c ∈ ℤ such that: b = ac. (note, 0 ∣ 0 is true, but 0 ∣ b for b ≠ 0 is false).
Highest Common Factor (HCF)
Let a, b ∈ ℤ, but not both zero. The hcf of a and b is the largest positive integer d that divides both a and b (d ∣ a and d ∣ b). (Note, hcf(a,b) is always ≥ 1, even if a or b are negative).
Coprime Numbers
Two integers a and b (both not zero) are coprime if: hcf(a,b) = 1
Prime Number
an integer p ≥ 2 is prime if its only positive divisors are 1 and p. (Note: 1 is neither prime nor composite because the definition explicitly requires p ≥ 2.)
Proposition 10.2 (hcf related)
a,b,d ∈ ℤ, and suppose d/a and d/b, then d/(ma+nb) for any m,n ∈ ℤ.
Proposition 10.3 (equation)
If a,b, ∈ ℤ, and d=hcf(a,b) then integers s and t exist such that d=sa+tb

The Limit Definition / First Principle Derivative

Alternative Limit Definition at a point x=a
Principle of Mathematical Induction
base case, prove P(smallest n)
inductive step, assume P(k) is true (inductive hypothesis) then prove P(k+1) using assumption
Strong Principle of Induction
base case P(smallest n)
assume P(m) is true for all integers m from n(0) up to k, then prove P(k+1) is true. (used when next step depends on multiple previous terms
Definition of Congruence (a≡b (mod m)
m divides (a-b), meaning a-b=kn for some integer k (a and b divided by n have the same remainder
Modular Arithmetic Multiplication Rule
if a≡b (mod m) and c≡d (mod m) then ac ≡ bd (mod m) aka you can reduce numbers modulo n at any step during multiplication to keep numbers small
Rule 5.1 with inequalities
if a ≤ b and c < 0, then ac ≥ bc (aka multiplying or dividing both sides of an inequality by a negative number reverses the inequality sign)
Critical Number
a dumber c in the domain of f such that f’(C) = 0 or dne
Concavity
f”> 0, concave up , f”< 0, concave down
inflection point
a point of the curve where f is continuous and the curve changes concavity (f”(x)) will change sign at cn
first derivative test → local extrema
f’ changes from + to -, local max,
f’ changes from - to +, local min
second derivative test → concavity
if f’c = 0,
if f”c > 0, concave up
if f”c <, concave down