1. Algebraic Methods Flashcards

1
Q

2 part partial fractions

A

Multiply A,B by the opposite denominator and find A,B

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Partial fraction methods

A
  1. Substitute the x to make brackets 0 to allow you to find A,B
    OR
  2. Equate each coefficient equally and use simultaneous equations
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

2 part repeated factors

A

A B
——— + ————
factor factor^2

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

3 part repeated factors

A

Multiply A,B,C each by what their respective denominators must be to make it the same as the overall denominator

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Improper fractions

A

The degree of the numerator is higher than the degree of the denominator

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Reducing to quotient and remainder

A

Divide the numerator by the denominator for the quotient

Answer = quotient + remainder/denominator

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Quotient and partial fractions

A

Divide for the quotient and convert the remainder into partial fractions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Proof by Contradiction

A
  1. Start by assuming the original statement is false
  2. Use logical steps to show that this contradiction leads to something impossible
  3. You can assume that your assumption was incorrect and the original value true
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Proving root 2 is irrational by contradiction

A

Start by assuming root 2 is rational and can be written as a/b, where a,b are integers and a/b is in its simplest form
Show that a,b must be even as both of their squares are even (show a is even then write b^2 in terms of a^2)
Therefore a/b must not be in its simplest form - contradiction

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Proving there are infinitely many primes

A

Start by assuming there are a finite number of primes, p1,p2,p3…pn
Let P = p1 x p2 x p3 x … x pn + 1
If P is prime it is bigger than any on the list
If P is not prime it must have a prime factor which is a factor of p1 x p2 x … x pn and 1, contradiction

How well did you know this?
1
Not at all
2
3
4
5
Perfectly