maths sem 1 exam :)

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/17

flashcard set

Earn XP

Description and Tags

yayayayayayaya

18 Terms

1
New cards

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).

2
New cards

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).

3
New cards

Coprime Numbers

Two integers a and b (both not zero) are coprime if: hcf(a,b) = 1

4
New cards

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.)

5
New cards

Proposition 10.2 (hcf related)

a,b,d ∈ ℤ, and suppose d/a and d/b, then d/(ma+nb) for any m,n ∈ ℤ.

6
New cards

Proposition 10.3 (equation)

If a,b, ∈ ℤ, and d=hcf(a,b) then integers s and t exist such that d=sa+tb

7
New cards
<p></p>


The Limit Definition / First Principle Derivative

8
New cards
term image

Alternative Limit Definition at a point x=a

9
New cards

Principle of Mathematical Induction

  1. base case, prove P(smallest n)

  2. inductive step, assume P(k) is true (inductive hypothesis) then prove P(k+1) using assumption


10
New cards

Strong Principle of Induction

  1. base case P(smallest n)

  2. 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


11
New cards

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

12
New cards

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

13
New cards

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)

14
New cards

Critical Number

a dumber c in the domain of f such that f’(C) = 0 or dne

15
New cards

Concavity

f”> 0, concave up , f”< 0, concave down

16
New cards

inflection point

a point of the curve where f is continuous and the curve changes concavity (f”(x)) will change sign at cn

17
New cards

first derivative test → local extrema

f’ changes from + to -, local max,

f’ changes from - to +, local min

18
New cards

second derivative test → concavity

if f’c = 0,
if f”c > 0, concave up
if f”c <, concave down