Scribd
Upload
17 views6 pages

12FM Alg Methods

The document outlines methods for simplifying algebraic fractions, dividing polynomials, and understanding the Remainder and Factor Theorems. It also discusses mathematical proof techniques, including logical argumentation and methods of proof such as exhaustion and counterexamples. Various examples are provided to illustrate these concepts.

Uploaded by

siddgand08
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
17 views6 pages

12FM Alg Methods

The document outlines methods for simplifying algebraic fractions, dividing polynomials, and understanding the Remainder and Factor Theorems. It also discusses mathematical proof techniques, including logical argumentation and methods of proof such as exhaustion and counterexamples. Various examples are provided to illustrate these concepts.

Uploaded by

siddgand08
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Year 1 – Algebraic Methods

Simplifying Algebraic Fractions

There are two methods:

a) Splitting the numerator


If there are several terms in the numerator, the fraction can be split into a number of individual fractions by
dividing the denominator into each of the terms on the numerator.

Examples

1)

( )
2)

3)

b) Factorising and cancelling

Example
1)

2)

Year 1 Page 138 Exercise 7A

1 C2 Algebra RJW
Dividing Polynomials

This is completed by algebraic long division. It is very similar to that of long division lower down the school.

Examples
1) (2𝑥 − 11𝑥 + 6) ÷ (𝑥 − 2)

2)

Year 1 Page 141 Exercise 7B


2 C2 Algebra RJW
Remainder (and Factor) Theorem

If a polynomial 𝑓(𝑥) is being divided by (𝑥 − 𝑎), and in doing so substituting 𝑥 = 𝑎 into 𝑓(𝑥) – i.e. evaluating
𝑓(𝑎) – gives the remainder from the division. This is known as the remainder theorem. Here you only need
to know the Factor Theorem, but it is important to understand that it is a special case of the remainder theorem.

Examples
1) Decide whether (𝑥 − 1) is a factor of 𝑓(𝑥) = 3𝑥 − 2𝑥 − 1.

2) Use the remainder theorem to find a factor of 𝑓(𝑥) = 𝑥 − 2𝑥 − 𝑥 + 2. Hence fully factorise 𝑓(𝑥).

3) Factorise fully 𝑓(𝑥) = 𝑥 − 7𝑥 − 6

Year 1 Page 145 Exercise 7C


3 C2 Algebra RJW
Mathematical Proof

A proof, is a logical argument that is methodical and always true. It will start with facts and then after working
through a series of logical steps, you can end up at the conclusion.

In a mathematical proof you should use the following steps:

 State any assumptions you make/are using.


 Show all steps in the proof
 Make sure that every step is logical/obvious
 Ensure to cover all possible cases
 Write a statement to conclude the proof.

Examples
1) Prove that (3𝑥 + 2)(𝑥 − 1)(𝑥 + 4) ≡ 3𝑥 + 11𝑥 − 6𝑥 − 8

LHS:
= (3𝑥 − 3𝑥 + 2𝑥 − 2)(𝑥 + 4)
= (3𝑥 − 𝑥 − 2)(𝑥 + 4)
= 3𝑥 + 12𝑥 − 𝑥 − 4𝑥 − 2𝑥 − 8
= 3𝑥 + 11𝑥 − 6𝑥 − 8

2) Prove that if (𝑥 − 𝑎) is a factor of 𝑓(𝑥) then 𝑓(𝑎) = 0

If (𝑥 − 𝑎) is a factor then 𝑓(𝑥) must factorise.


𝑓(𝑥) = (𝑥 − 𝑎)𝑔(𝑥)
Where 𝑔(𝑥) is a function of 𝑥
Then let 𝑥 = 𝑎
𝑓(𝑎) = (𝑎 − 𝑎)𝑔(𝑎)
𝑓(𝑎) = 0 × 𝑔(𝑎)
𝑓(𝑎) = 0

3) The equation 2𝑥 + 3𝑘𝑥 − 3𝑘 = 0 has two distinct real roots. Find the values of 𝑘 that satisfy this.

𝑏 − 4𝑎𝑐 > 0
(3𝑘) − 4(2)(−3𝑘) > 0 20 y

9𝑘 + 24𝑘 > 0
3𝑘(3𝑘 + 8) > 0 10

𝑘 < − or 𝑘 > 0 -3 -2 -1 1

8 -10

𝑘: 𝑘 < − ∪ {𝑘: 𝑘 > 0}


3 -20

Year 1 Page 149 Exercise 7D

4 C2 Algebra RJW
Methods of Proof

One method of proof is exhaustion. This is testing an idea until you cover all the possibilities. This is not
always possible if the proof has an infinite number of combinations.

Examples
1) Prove that (𝑛 + 1) ≥ 3 for 𝑛 ∈ ℕ, 𝑛 ≤ 4

2) If 𝑛 is a positive integer then 𝑛 − 𝑛 is divisible by 7.

5 C2 Algebra RJW
Another method of proof is by counter example. This requires you to find just one example that disproves the
statement.

Example
1) Disprove that if 𝑎 = 𝑏 , then 𝑎 = 𝑏 if 𝑎, 𝑏 ∈ ℤ.

2) If 𝑝 is prime, then 𝑀 = 2 − 1 is prime.

Year 1 Page 152 Exercise 7E


Year 1 Page 154 Mixed Exercise 7
Assessment
6 C2 Algebra RJW

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy