Given an integer m which is the slope of a line, the task is to find the slope of the line which is parallel to the given line.
Input: m = 2
Input: m = -3
Let P and Q be two parallel lines with equations y = m1x + b1, and y = m2x + b2 respectively.Here m1 and m2 are the slopes of the lines respectively. Now as the lines are parallel, they don’t have any intersecting point, and hence there will be no system of solutions for the lines. So, let us try to solve the equations,
For y, m1x + b1 = m2x + b2
m1x – m2x = b2 – b1
x(m1 – m2) = b2 – b1
The only way there can be no solution for x is for m1 – m2 to be equal to zero.
m1 – m2 = 0
This gives us m1 = m2 and the slopes are equal.
Below is the implementation of the above approach:
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Slope of perpendicular to line
- Program to find slope of a line
- Find points at a given distance on a line of given slope
- Find the slope of the given number
- Equation of straight line passing through a given point which bisects it into two equal line segments
- Straight-line Number
- Least Square Regression Line
- Reflection of a point about a line in C++
- Find the other end point of a line with given one end and mid
- Chain Code for 2D Line
- Perpendicular distance between a point and a Line in 2 D
- Bresenham's Algorithm for 3-D Line Drawing
- Check whether two points (x1, y1) and (x2, y2) lie on same side of a given line or not
- How to check if two given line segments intersect?
- Check whether the point (x, y) lies on a given line
- One line function for factorial of a number
- Direction of a Point from a Line Segment
- Check if a line passes through the origin
- Program to find the mid-point of a line
- Represent a given set of points by the best possible straight line
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.