Answer:
C
Step-by-step explanation:
plz mark brainliest :)
Answer with explanantion:
1. What is asked? <u>The smallest number of eggs that Mang Andoy can put using the tray.</u>
2. What are given facts? <u>Two kinds of tray (One can have 6 eggs , other can have 12 eggs)</u>
3. How will you solve the problem? <u>We need to find LCM of 6 and 12</u>.
4. How is the solution done?
<u>Prime factorization of 6 and 12:</u>
<u>6=2 x 3</u>
<u>12 = 2 x 2 x 3</u>
<u>LCM(6,12) = 2 x 2 x 3 = 12</u>
5. What is the answer to the problem?<u> The smallest number of eggs that Mang Andoy can put using the tray = 12</u>
Answer:
Step-by-step explanation:
The given system is:
Since I prefer to use smaller numbers I'm going to divide both sides of the first equation by 3 and both sides of the equation equation by 6.
This gives me the system:
We could solve the first equation for 
and replace the second with that.
Let's do that.
Subtract 
on both sides:
So we are replacing the second in the second equation with 
which gives us:
Now recall the first equation we arranged so that was the subject. I'm referring to .
We can now find given that using the equation .
Let's do that.
with :
So the solution is (8,-1).
We can check this point by plugging it into both equations.
If both equations render true for that point, then we have verify the solution.
Let's try it.
with 
:
is a true equation so the "solution" looks promising still.
with :
is also true so the solution has been verified since both equations render true for that point.
