4, 5, and 7 are mutually coprime, so you can use the Chinese remainder theorem right away.
We construct a number 
such that taking it mod 4, 5, and 7 leaves the desired remainders:
- Taken mod 4, the last two terms vanish and we have
so we multiply the first term by 3.
- Taken mod 5, the first and last terms vanish and we have
so we multiply the second term by 2.
- Taken mod 7, the first two terms vanish and we have
so we multiply the last term by 7.
Now,
By the CRT, the system of congruences has a general solution
or all integers 
, 
, the least (and positive) of which is 27.
Answer: I think the last one sorry of I am wrong
Step-by-step explanation:
Answer:
Step-by-step explanation:
Total cost for the three nights
Total_3 = $298.17 + 3*u
Where <em>u </em>represents the unknown fees for a single day
To find the daily cost, we divide the previous equation by three
Daily cost = ($298.17 + 3*u)/3
Daily cost = ($99.39 + u)
So, if we create an inequality for the daily cost
Let x = Daily cost
x > $99.39
She will pay more than $99.39 per night
Answer:
yes this is a function
Step-by-step explanation:
simple method to find if something is a function
if you can draw a vertical line at any point on the graph and get two intersections, it is not a function
