Well give me a list of questions and I will try to solve them for you.
Answer:
Should be a dress code i hope this helps god bless you all
Step-by-step explanation:
Greetings!To find the
y-intercept, we can arrange the equation in
slope y-intercept form:
Rearrange:


The
y-intercept is:
-13 
To find the
x-intercept, we can input the value
<<0>> in the place of y, as every x-intercept only occurs when
y=0:
Solve for x:




The
x-intercept is:

I hope this helped!
-Benjamin
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.
I think that it would be 34+d because if you were trying to get 32 more than a number you would add the number plus the varaible.