The point whose abscissa is - 3 and lies on

the system of inequity is

step-by-step explanation:

from the given graph it is noticed that we have two related lines. one is solid and another is dashed.

if a line passing through two points, then the equation of line is

the solid line passing through the points (0,4) and (4,0).

the related equation of solid line is .

similarly, find the related equation of dashed line. the dashed liune passing through the points (0,0) and (3,1).

the related equation of dashed line is

from the given graph it is noticed that the point (0,1) lies on the shaded region, therefore the point (0,1) must be satisfied by the related equations.

check the related equations by the point (0,1).

this statement is true if the sign of inequality is < instead of equality. since it is an solid line therefore the sign of inequality will be . the required inequality is

similarly, check the second related equation.

it is a dashed line, so this statement is true if the sign of inequality is > . the required inequality is

your exact question is kind of difficult to understand, so maybe an example will explain what you're supposed to do? i'll work through the first problem on the worksheet.

suppose you have a tray of 652 brownies, and you have 5 friends that you want to feed without picking favorites. how many brownies can you dole out to each of your friends in equal amounts? how many will be left over for you to eat?

what you're doing here is finding a way to arrange the number 652 as the sum of integer multiple of 5 and some remainder:

here ("q" for quotient) is the number of brownies each of your friends get, and is the remainder. that's the basic idea behind division.

we break up the number 652 into parts so that the leading digit stands on its own:

652 = 600 + 52

first we check if it's possible to hand out exactly 100 brownies to each friend. with 5 friends, this means we want to know if we can take out 500 brownies from the tray. we can do this 1 time because we have 600 brownies to take from, and when we do that we're left with 100 + 52 brownies to divvy up. so we know that

652 = 1*500 + 152

next we want to know if it's possible to hand out exactly 10 brownies per friend. if we can, we have to remove 50 brownies from the tray each time until we can't. we have 152 brownies left, and we know that 3(50) = 150, so

152 = 3*50 + 2

now we have 2 brownies left in the tray. is it possible to hand 1 out to each of your 5 friends? no, you'd need a minimum of 5 brownies to do that. so the last 2 are yours.

putting everything together, we found that

652 = 1*500 + 3*50 + 2

and we can rearrange this to write

652 = 5*100 + 5*30 + 2

652 = 5(100 + 30) + 2

652 = 5*130 + 2

so and .

you might be more accustomed to the table depicting the algorithm. that's just a compact way of organizing what we've done above. you can consult the image i've attached below.

step-by-step explanation:

assume that you have 3 different side lengths.   apply the pythagorean theorem here:   square each of the two shortest sides; call them a and b, so that their squares are a² and b².   also square the longest side, calling the result c².

now, if a² + b² = c² is true, the triangle is a right triangle; otherwise it is not a right triangle.