Difference between revisions of "Line"
m (proofreading) |
|||
| (3 intermediate revisions by 2 users not shown) | |||
| 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. | + | 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. infinitely thin but also infinitely 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]]. |
| Line 5: | Line 5: | ||
=== Example Problem === | === Example Problem === | ||
* [[2006_AMC_10B_Problems/Problem_12 | 2006 AMC 10B Problem 12]] | * [[2006_AMC_10B_Problems/Problem_12 | 2006 AMC 10B Problem 12]] | ||
| + | |||
| + | |||
| + | == See also == | ||
| + | * [[Linear]] | ||
| + | |||
| + | {{stub}} | ||
Latest revision as of 17:40, 9 May 2024
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. infinitely thin but also infinitely 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.
Introductory
Example Problem
See also
This article is a stub. Help us out by expanding it.
