Difference between revisions of "Line"
IntrepidMath (talk | contribs) |
(added intro problem example) |
||
| Line 1: | Line 1: | ||
A ''line'' in the euclidean sense is defined as the shortest distance between two points. It is defined to be in 1 direction only, i.e. infiinitly thin but also infinitly long. In the [[cartesian coordinate system]] it is usually described as an equation in ''x'' and ''y'' of the form <math>y=mx+b</math> where ''m'' is the [[slope]] of the line and ''b'' is the [[y-intercept]]. Any two points define a line, and given specific <math>(x_1,y_1)</math> <math>(x_2,y_2)</math> one can solve for the line's [[equation]]. | A ''line'' in the euclidean sense is defined as the shortest distance between two points. It is defined to be in 1 direction only, i.e. infiinitly thin but also infinitly long. In the [[cartesian coordinate system]] it is usually described as an equation in ''x'' and ''y'' of the form <math>y=mx+b</math> where ''m'' is the [[slope]] of the line and ''b'' is the [[y-intercept]]. Any two points define a line, and given specific <math>(x_1,y_1)</math> <math>(x_2,y_2)</math> one can solve for the line's [[equation]]. | ||
| + | |||
| + | |||
| + | == Introductory == | ||
| + | === Example Problem === | ||
| + | * [[2006_AMC_10B_Problems/Problem_12 | 2006 AMC 10B Problem 12]] | ||
Revision as of 04:14, 18 July 2006
A line in the euclidean sense is defined as the shortest distance between two points. It is defined to be in 1 direction only, i.e. infiinitly thin but also infinitly long. In the cartesian coordinate system it is usually described as an equation in x and y of the form 
where m is the slope of the line and b is the y-intercept. Any two points define a line, and given specific 
one can solve for the line's equation.
