No solution exists for -3x+y=-18 and -3x+y=-6
Answer:
In a quadratic equation of the shape:
y = a*x^2 + b*x + c
we hate that the discriminant is equal to:
D = b^2 - 4*a*c
This thing appears in the Bhaskara's formula for the roots of the quadratic equation:
You can see that the determinant is inside a square root, this means that if D is smaller than zero we will have imaginary roots (the graph never touches the x-axis)
If D = 0, the square root term dissapear, and this implies that both roots of the equation are the same, this means that the graph touches the x axis in only one point, wich coincides with the minimum/maximum of the graph)
If D > 0 we have two different roots, so the graph touches the x-axis in two different points.
Answer: A and D
Step-by-step explanation:
Table B : not a function the value of x=3 has two images
Table C: not a function the value of x=1 has two images
Tables A and D are functions
Answer:
- 8 small houses; 0 large houses
- 80 small houses; 0 large houses
Step-by-step explanation:
a) The maximum number of houses Sam can build in 24 hours is 8, so the constraint is in construction, not decoration. For each small house Sam constructs, he makes $10/3 = $3.33 per hour of work. For each large house Sam constructs, he makes $15/5 = $3.00 per hour. The most money is to be made by building only small houses.
Sam should make 8 small houses and 0 large houses in 24 hours.
__
b) If Sam works 8-hour days, then he can complete at most 80 small houses. The constraint remains in construction, so the answer is the same: build only small houses.
_____
If Sam works more than 16 2/3 hours per day, he can build 100 large houses or more, so the constraint moves to decoration. The decorator makes more money by decorating large houses, so all the effort should go to construction of large houses.
If Sam works between 10 and 16 2/3 hours per day, the best revenue will come from some mix. The problem statement is unclear as to how many hours Sam works in 30 days.
