What is a linear function?
A linear function has a straight-line graph and can be written as , where is the slope and is the y-intercept.
Study 05/14 5. Linear Functions and Models with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.
What is a linear function?
A linear function has a straight-line graph and can be written as f(x)=mx+b, where m is the slope and b is the y-intercept.
What do the parameters mean in a linear model?
In y=mx+b, m is the rate of change and b is the initial value when the input is zero.
What does slope measure?
The slope is the constant rate of change: m=ΔxΔy. It measures vertical change per unit of horizontal change.
How do you calculate slope from two points?
For (x1,y1) and (x2,y2), use m=x2−x1y2−y1, with x1=x2.
How does slope determine graph direction?
If m>0, the function is increasing; if m<0, it is decreasing; and if m=0, it is constant.
What are the special cases for line slope?
A horizontal line has slope 0. A vertical line has undefined slope because its horizontal change is zero.
How do you identify the y-intercept?
The y-intercept is (0,b), found by setting x=0 in y=mx+b.
How do you find the x-intercept?
Set y=0 and solve for x. The resulting point is the x-intercept, also called the zero of the function.
What is point-slope form?
Point-slope form is y−y1=m(x−x1). It is useful when a line’s slope and one point are known.
What is standard form for a line?
Standard form is Ax+By=C, usually with integer coefficients and often with A>0.
How do you graph y=mx+b?
Plot the y-intercept (0,b), use the slope as rise over run to plot more points, then draw the line through them.
What is a piecewise function?
A piecewise function uses different formulas on different parts of its domain; each formula applies only when its condition is satisfied.
A progressive guide to interpreting, calculating, and applying limits, asymptotes, continuity, and the Intermediate Value Theorem.
A medium-difficulty quiz on relations, relation properties, equivalence relations, partial orders, functions, injectivity, surjectivity, bijections, and inverse functions. The questions emphasize applying definitions to examples and interpreting mathematical structure.
A progressive guide to converting, graphing, differentiating, and integrating polar curves, with emphasis on symmetry, intersections, area, and arc length.
A 14-question quiz on mathematical induction, strong induction, well-ordering, recursive definitions, and structural induction. Questions progress from introductory recognition to medium-difficulty application and proof reasoning.
A 14-question quiz on sequences, sequence limits, monotonicity, boundedness, convergence criteria, the Squeeze Theorem, limit laws, and recursive sequences. Questions progress from foundational understanding to applied reasoning.
A structured guide to vector spaces, subspaces, spans, independence, bases, dimension, and coordinates, with definitions, tests, examples, and a unified problem-solving workflow.
A medium-difficulty quiz on advanced counting methods, including binomial coefficients, stars and bars, the binomial theorem, inclusion-exclusion, recurrences, tilings, derangements, and characteristic equations.
A progressive guide to choosing and applying binomial coefficients, the binomial theorem, inclusion-exclusion, and recurrence relations in advanced counting problems.
A progressive guide to identifying eigenvalues and eigenvectors, computing eigenspaces, comparing algebraic and geometric multiplicities, and determining when a matrix can be diagonalized.
A progressive guide to representing functions with power and Taylor series, determining convergence, manipulating series, and controlling approximation error.
A medium-difficulty quiz on sequences, summation techniques, recurrence relations, characteristic roots, generating functions, and recursive algorithms. Questions progress from foundational applications to more involved reasoning.
A structured guide to describing sequences, simplifying sums, modeling and solving recurrence relations, using generating functions, and analyzing recursive algorithms.