Answer:
(3,1) --> One solution
Step-by-step explanation:
Start by multiplying the first equation by 4:
-7x(4)+2y(4)=-19(4)
-28x+8y=-76
In this scenario, we can eliminate 8y by subtracting the two equations:
-34x=-102
Divide both sides by -34
x=3
Plug 3 back in for x to solve for y
-7(3)+2y=-19
-21+2y=-19
Add 21 to both sides
2y=2
Divide both sides by 2
y=1
(x,y)=(3,1)
Answer:
percent of iron in alloy= 100-42 = 58%
weight of the iron = 55×58÷100= 31.9
weight of iron= 31.9 kg
weight of copper= 55-31.9=23.1
weight of copper = 23.1
Step-by-step explanation:
[ I'm not sure but I think this is right ]
Answer:
A A A B B B C C C
Step-by-step explanation:
We have the Greedy algorithm, the solution at any time is considered an optimal algorithm.
In our case the sequence is x x x y y y z z z
In addition to the Greedy algorithm, the first advertiser chooses their choice without considering the minimum methods.
Now we must consider the worst case of greedy algorithm so we must suppose that it starts from advertiser C, then B and followed by A.
Therefore the worst option would come being:
C C C B B B, in addition that A cannot bid for any query.
Which means that the sequence of the balanced algorithm will be A A A B B B C C C
Answer:
-25/6
Step-by-step explanation:
