Find the Slope<span> and Y-Intercept y-</span>3=2(x-1). y−3=2<span>(x−1) y - </span>3<span> = </span>2<span> ( x - 1 ). Rewrite in </span>slope<span>-intercept form. Tap for more steps</span>
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.
Use the Pythagorean theorem for this. (a^2+b^2=c^2)
a=9, b=12, c=x
9^2+12^2=c^2
81 + 144 = c^2
225 = c^2
c =15
the answer is c
Answer:
x = -2
Step-by-step explanation:
Isolate the variable by dividing each side by factors that don't contain the variable.
Answer: The answer is 0.1111111111111
Step-by-step explanation: