Answer:
I think you can find these answers online...
A good website that I used to use for books like these was www.slader.com, but it might not have everything.
Step-by-step explanation:
Answer:
its one solution
Step-by-step explanation:
Area of each piece of paper is
Greatest number of possible piece of paper is
![[1000\div\frac{187}{2}]=[1000\times\frac{2}{187}]=[\frac{2000}{187}]=10](https://tex.z-dn.net/?f=%5B1000%5Cdiv%5Cfrac%7B187%7D%7B2%7D%5D%3D%5B1000%5Ctimes%5Cfrac%7B2%7D%7B187%7D%5D%3D%5B%5Cfrac%7B2000%7D%7B187%7D%5D%3D10)
Step-by-step explanation:
y = 2x - 15
4x + 3y = -5
4x + 3(2x - 15) = -5
4x + 6x - 45 = -5
10x = 40
x = 40/10
x = 4
y = 2x - 15
y = 2(4) - 15
y = 8 - 15
y = -7
Solution = (4,-7)
Option → C
