Using the digits 0 to 9 at most one time each, fill in the boxes to make a true equation.

1234567891011 match the reasons with the statements in the proof. given: j | | k m 1 = m 3 prove: l | | m 1. j||k, m∠3 = m∠1 if lines are ||, then corresponding angles are =. 2. m∠1 = m∠2 if alternate interior angles are =, then lines are ||. 3. m∠2 = m∠3 substitution 4. l||m given

Michelle had a birthday party. she bought a bag of candy with 96 starbursts, 72 hershey's, and 68 reese's. she wants to use all the candy she bought to make goody bags with the same amount of starbursts, hershey's and reese's in each bag. what is the largest number of bags she can make?

Girardo is using the model below to solve the equation . girardo uses the following steps: step 1 add 4 negative x-tiles to both sides step 2 add 1 negative unit tile to both sides step 3 the solution is which step could be adjusted so that gerardo's final step results in a positive x-value? in step 1, he should have added 4 positive x-tiles to both sides. in step 1, he should have added 3 negative x-tiles to both sides. in step 2, he should have added 4 negative unit tiles to both sides. in step 2, he should have added 1 positive unit tile to both sides.