Point-slope form looks like this: y - k = m(x - h) where m is the slope, k is the y-value and h is the x-value. For (-3, -8), -3 would replace h and -8 would replace k.
Slope-intercept form looks like this: y = mx + b where m is the slope and b is the y-value.
To solve the problem we must plug in the given coordinate and slope to the point-slope formula then change the point-slope form into slope-intercept form. But first we need to know what the slope is.
If a line is perpendicular to another line, their slopes are negative reciprocals of each other. So with the line y = 3/2x + 3, the slope for another line that is perpendicular has to be -2/3 because we switched the numerator and denominator and made it from positive to negative.
Now that we know the slope and the given coordinate, we can start solving.
Plug the givens into the point-slope formula y - k = m(x - h).
y - (-8) = -2/3(x - (-3))
y + 8 = (-2/3*x) - (-2/3*-3)
y + 8 = -2/3x + 2 Now we can convert the equation to slope-intercept form.
y + 8 - 8 = -2/3x + 2 - 8 Remember that what we do on one side we must do one the other, so we subtract 8 on the left <em>and </em>right to get y by itself.
y = -2/3x - 6 This equation is now in slope-intercept form y = mx + b, so this is the final result.
I hope this explanation made sense. If there is anything that I made look confusing, feel free to tell me and I'll try my best to explain!
Answer:
1/6 chance
Step-by-step explanation:
a six sided die has 6 numbers, there is an equal chance that any of them can be rolled. 3 is one of those numbers. B=1/6 chance
Answer: 32/6
I hope this answer helps!
Answer:
The greatest number of stamps that Nathan can put on each page = 16.
Step-by-step explanation:
Given:
Nathan has:
80 US stamps
64 Canadian stamps
32 Mexican stamps
The stamps need to put on a page such that each page has same number of same country stamps on each page.
To find the greatest number of stamps he can put on each page.
Solution:
In order to find the greatest number of stamps Nathan can put on each page, we will find the G.C.F. of the three numbers.
The numbers are:
<em>We will list down the prime factors of each number.</em>
The G.C.F can be given as = 
= 16
Thus, the greatest number of stamps that Nathan can put on each page = 16.
Answer:2.5
Step-by-step explanation: just do 6 divided by 15 and the rate is 2.5
