Find the equation of the line perpendicular to y = -2/5x + 3 and passing through the point (7,-1)

solution:

we have to construct

∠m nt ≅ ∠p qr

the steps to draw this construction are

step 1: use a compass to draw an arc from point q which intersects the side pq at point a and the side qr at point b.

step 2: draw a segment nt and use the same width of the compass to draw an arc from point n which intersects the segment nt at a point x.

step 3:

step 4: join points n and y using a straightedge.

step 3:

option (d).maintaining the same width of the compass as ab, draw an arc from point x such that it intersects the arc drawn from n in a point y.

to draw   congruent angles , 1. width of compasses while drawing two angles should be same i.e from point at which angle has to be drawn, 2.the distance between the two points where the compass intersects the two sides should be same while drawing any two congruent angles.

in mathematics, a constraint is a condition of an optimization problem that the solution must satisfy. there are several types of constraints—primarily equality constraints, inequality constraints, and integer constraints. the set of candidate solutions that satisfy all constraints is called the feasible set.

hoped i'm right lol

answer: idk wbu

step-by-step explanation: umm..

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.