First we need to differentiate y



Now let it be 0




Put it in y


The quotient remainder theorem: Given any integer A, and a positive integer B, there exist unique integers Q and R such that
A= B · Q + R where 0 ≤ R < B.
Q is called quotient and R is called remainder.
According to this theorem, when you divide any number by 41, you can obtain remainder R such that 0 ≤ R < 41. Then the greatest possible whole number remainder is 40.
<h2>(1, 4)</h2><h2 />
To solve this system by addition, notice that if we add these two equations together, neither one of our variables will cancel out.
In this situation, we need to set things up so that when we do add our two equations together, one of the variables will cancel out.
Notice that we have a 10x in our second equation. if we had a -10x in our first equation, then the x's would cancel out.
To create a -10x, we can multiply the top equation by -2 to get a -10x.
From there, rewriting our equation gives us -10x - 2y = -18.
Now the x's cancel. Just add the equations together
now to get the two-step equation -9y = -36.
Solving from here, <em>y = 4</em>.
Now plug y into either one of the equations
to find that x =1.
So our solution is (1,4).