This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision | ||
urp:algebra [2021-12-19] nerf_herder [Arithmetic Sequences] |
urp:algebra [2022-02-01] (current) nerf_herder [Arithmetic Sequences] |
||
---|---|---|---|
Line 36: | Line 36: | ||
https://courses.lumenlearning.com/suny-osalgebratrig/chapter/parametric-equations/ | https://courses.lumenlearning.com/suny-osalgebratrig/chapter/parametric-equations/ | ||
- | ==== Arithmetic Sequences ==== | + | ==== Arithmetic/Geometric Sequences ==== |
+ | |||
+ | **Arithmetic sequence** has a constant difference between the terms, such as 1, 3, 5, 7, 9... | ||
Basic form to find term n: a(n) = a(1) + d(n-1), where d = step size (difference between terms), a(1) is the first term | Basic form to find term n: a(n) = a(1) + d(n-1), where d = step size (difference between terms), a(1) is the first term | ||
Line 45: | Line 47: | ||
If don't know last term, just substitute a(n): | If don't know last term, just substitute a(n): | ||
S = n/2 (2a + (n − 1) d) | S = n/2 (2a + (n − 1) d) | ||
+ | |||
+ | **Geometric sequence** terms are found by multiplying the previous term by a constant, such as 2, 4, 8, 16 ... | ||
+ | |||
+ | a(n) = arⁿ⁻¹ | ||
+ | |||
+ | Other sequences exist: | ||
+ | * squares: a(n) = n², cubes, etc. | ||
+ | * triangular numbers: a(n) = n(n+1)/2 (number of dots in a triangle of n rows) | ||
+ | * fibonacci sequence: a(n) = a(n-1) + a(n-2) | ||
Convergence of a power sequence: http://math.bu.edu/people/prakashb/Teaching/32LS10/Lectures/11-2.pdf | Convergence of a power sequence: http://math.bu.edu/people/prakashb/Teaching/32LS10/Lectures/11-2.pdf | ||
Line 71: | Line 82: | ||
Graphing an inverse: reflection of the graph about the line y=x | Graphing an inverse: reflection of the graph about the line y=x | ||
- | **horizontal and vertical asymptotes:** | + | **asymptotes** |
y = (quadratic1 of x) / (quadratic2 of x) | y = (quadratic1 of x) / (quadratic2 of x) | ||
* vertical asymptotes (VA) are when denominator goes to zero | * vertical asymptotes (VA) are when denominator goes to zero | ||
* horizontal asymptotes (HA) is when x goes to infinity, look at highest order of x in numerator and denominator: | * horizontal asymptotes (HA) is when x goes to infinity, look at highest order of x in numerator and denominator: | ||
* y = axⁿ / bxᵏ | * y = axⁿ / bxᵏ | ||
- | * if n > k : no HA | ||
* if n < k : HA = 0 | * if n < k : HA = 0 | ||
* if n = k : HA = a/b | * if n = k : HA = a/b | ||
+ | * if n > k : no HA | ||
+ | * if n = k+1 : oblique (diagonal) asymptote - approaches the line y = mx+b (from polynomial long division) | ||
+ | * if n > k+1 : no asymptote | ||
+ | |||
+ | look halfway down the page here: https://www.mathsisfun.com/algebra/rational-expression.html | ||
====Interest, half life, amortization==== | ====Interest, half life, amortization==== |