3. a company makes a profit of $50 per software program and $35 per video game. the company can produce at most 200 software programs and at most 300 video games per week. total production cannot exceed 425 items per week. how many items of each kind should be produced per week in order to maximize the profit?
in this linear programming problem, solve the system to determine the vertices of the feasible region and use those (x, y) values in the objective function to find the maximum profit.
show all your work. objective function: p = 50x + 35y (where x = the number of software programs and y = the number of video games produced in a week) constraints (graphed below):

answer: all of the odd numbers were opened

the first person was the one that was opening all of the lockers. since one is odd, this causes all of the odd number lockers to be opened in the end.

b

step-by-step explanation:

u take $75 minus $60.the anwer/original($75)multiply by 100

alright so i think for this one it would to draw it out. this may be hard for me to try and draw, but i will do my best on here:

        r

  /       |     \

notice how it forms 2 triangles inside one bigger triangle.

so if we know the angle spr is the same as psr that is saying the measure of angle p is the same as angle s. this means the big triangle psr is either isosceles or equilateral. in both cases, the triangle is perfectly symmetrical when split down the middle, which is in this case rq. because we know it is perfectly symmetrical on both sides, we know that the two triangles inside the bigger one are equal.

answer: the correct option is d.

explanation:

it is given that the triangle j'k'l' shown on the grid below is a dilation of triangle jkl using the origin as the center of dilation.

from the given graph it is noticed that k(4,8) and k'(2,4). let origin is defined by o and scale factor is defined by k, then

    (1)

distance formula,

put these values in equation (1).

therefore scale factor is     and option d is correct.