I think it’s SAS
SAS Means: If any two angles and the included side are the same in both triangles, then the triangles are congruent
I will try to solve your system of equations.
3
x
−
4
y
=
2
;
9
x
−
12
y
=
6
Step: Solve
3
x
−
4
y
=
2
for x:
3
x
−
4
y
+
4
y
=
2
+
4
y
(Add 4y to both sides)
3
x
=
4
y
+
2
3
x
3
=
4
y
+
2
3
(Divide both sides by 3)
x
=
4
3
y
+
2
3
Step: Substitute
4
3
y
+
2
3
for
x
in
9
x
−
12
y
=
6
:
9
x
−
12
y
=
6
9
(
4
3
y
+
2
3
)
−
12
y
=
6
6
=
6
(Simplify both sides of the equation)
6
+
−
6
=
6
+
−
6
(Add -6 to both sides)
0
=
0
Answer:
Infinitely many solutions.
I think it would be layer 4
Here, what we want to find is the lowest number of bottles / soaps while having the total inventory used. As we want the number of bottles and soaps to fit perfectly, we have to find a common divisor of 48 and 64. In addition, since we want the maximum number of baskets, we want to find the highest common divisor of the two numbers. Using a little guess and check, we can find 16 baskets as our answer. To have the same number of soaps and lotions in each, we have 48/16= 3 soaps per basket and 64/16=4 lotions per basket.
Feel free to contact me with further questions.
