Algebra 3

Diophantine Equations
• When the number of equations is less than the number of unknowns,
then the equations are called as “Diophantine Equations”
Progression
• It is the sequence of numbers called terms, each of which, after the
first is derived from the preceding one.
• Types:
Arithmetic Progression
Geometric Progression
Infinite Geometric Progression
Harmonic Progression
Arithmetic Progression
-common difference (d)
• Basic Formula: • Common difference (d)
• nth term of AP:

• Arithmetic Mean:
• Sum of AP:
Calcu Tech for AP
• Mode 3(STAT), 2(A+BX) then • For common difference:
input data
• For nth term: •
• For sum:
• For n:
•)
Geometric Progression
-common ratio
• Basic Formula: • Common ratio (r)
• nth term of GP:

• Geometric Mean:
• Sum of GP:
Calcu Tech for GP
• Mode 3(STAT), 6(A*B^X) then • For common ratio:
input data
• For nth term: •
• For sum:
• For n:
•)
Infinite Geometric Progression
-GP that approaches infinity
• Basic Formula: • Calcu Tech:
• Sum of IGP: • For sum:

• Where n is any large number

Harmonic Progression
-reciprocal of AP
• Examples:
• 1/2, 1/4, 1/6, 1/8, …
• Can be solved by converting every term first into arithmetic
progression by getting the reciprocal of the terms.
Principles of Counting
Two Events “h” and “k”
• Principle 1: Simultaneous or Successive Events
• Keyword - > “and”
• Number of ways (N) = h x k
• Principle 2: Mutually Exclusive Events
• Keyword - > “or”
• Number of ways (N) = h + k
Arrangements
• Permutation – ordered arrangement. ABC ≠ BCA
• Order is important.
• Calcu: SHIFT, ×
• Combination – grouping arrangement. ABC = BCA
• Order is not important.
• Calcu: SHIFT, ÷
Permutation
• “n” different things taken “r” at a time

• “n” different things taken “n” at a time

• “n” different things taken “n” at a time with some “alike”

Permutation
• “n” different things taken “r” at a time with some “alike”

• Cyclic or Ring Permutation

• Permutation of “n” objects taken 1, 2, 3, …, n at a time

Combination
• “n” different things taken “r” at a time

• “n” different things taken “n” at a time

• Combination of “n” objects taken 1, 2, 3, …, n at a time

Theory of Sets
- any defined collection of elements, class, things or objects
SET OPERATIONS: • Intersection, ∩ -> common
• Union, ∪ -> combined • The intersection of sets “A” and
• The union of sets “A” and “B” is “B” is the set of elements which
the set of elements which belongs to A and also belongs to
belongs to A or to B or to both. B.
• Example: • Example:
• A = {b, a, t} • A = {b, a, t}
• B = {m, a, n} • B = {m, a, n}
• A∪B = {b, a, t, m, n} • A∩B = {a}
Theory of Sets
• Difference, - • Complement, c -> does not belong
• The difference of sets “A” and • The complement of set “A” is the
“B” is the set of elements which set of elements which does not
do not belong to B. belong to “A”
• Example: • Example:
• A = {b, a, t} • A = {2, 4, 6, 8, . . . .}
• B = {m, a, n} • Ac = {1, 3, 5, 7, . . . .}
• A - B = {b, t} • Note: Ac = Ā
• B - A = {m, n}
Venn Diagram
• Also called primary diagram, set diagram, or logic diagram
• It is a diagram that shows all possible logical relations between a finite
collection of different sets
• Developed by John Venn in 1880.