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.
You would use order or operations to solve this problem
4 to the second power is 16 -------> 12+16= 28
Your answer would be 28
Well if you use graph paper you can graph the points you already have and then you can find the slope of the line easiest that way, the next point would be. (-1,8)
We can't conclude FA=FC.
Let's go with the obvious, AD=BD, BE=CE by the definition of bisector