Well if you make them both equal to y I got...
Y=-3x+1
Y=5x-3
But I don't think you can find it without the y since they are different variables. Like I know -3x and 5x are the slopes and 1 and -3 are the y intercepts but I'm stuck after that. Sorry if that wasn't any help.
Hope I helped.
Answer:
- 40 packages from Fred Motors
- 20 packages from Admiral Motors
- 40 packages from Chrysalis
Step-by-step explanation:
I would formulate the problem like this. Let f, a, c represent the numbers of packages bought from Fred Motors, Admiral Motors, and Chrysalis, respectively. Then the function to minimize (in thousands) is …
objective = 500f +400a +300c
The constraints on the numbers of cars purchased are …
5f +5a +10c >= 700
5f +10a +5c >= 600
10f +5a +5c >= 700
Along with the usual f >=0, a>=0, c>=0. Of course, we want all these variables to be integers.
Any number of solvers are available in the Internet for systems like this. Shown in the attachments are the input and output of one of them.
The optimal purchase appears to be …
- 40 packages from Fred Motors
- 20 packages from Admiral Motors
- 40 packages from Chrysalis
The total cost of these is $40 million.
Answer:
x=5/2
Step-by-step explanation:
Calculate, rewrite, remove the paretheses
Collect the like terms
Swap sides 75=30x swap to 30x=75
Then divide both sides
Answer:
You found the area of each side of the rectangular prism, subtracting the missing area from the front and back sides of the prism. Then you added together the area of all 6 faces to find the total outer surface area.
I hope this helps :)
Step-by-step explanation:
Y = 2^x
For a 64 team tounament, 64 = 2^6, so there will be six rounds of play.
For a 128 team tounarment, 128 = 2^7, so there will be 7 rounds of play.
Any number of teams which is not a power of 2 is an inappropriate number of team for tounament play.