Beginning Algebra Tutorial 13


Beginning Algebra
Answer/Discussion to Practice Problems
Tutorial 13: Multiplication Property of Equality


WTAMU > Virtual Math Lab > Beginning Algebra > Tutorial 13: Multiplication Property of Equality


 

checkAnswer/Discussion to 1a

problem 1a
 

ad1a
*Inverse of mult. by -8 is div. by -8 

 
If you put -3 back in for a in the original problem you will see that -3 is the solution we are looking for.

 
(return to problem 1a)

 


 

checkAnswer/Discussion to 1b

problem 1b
 

ad1b
*Inverse of mult. by 2/3 is did. by 2/3 
(or mult. by reciprocal 3/2)

 
If you put 12 back in for x in the original problem you will see that 12 is the solution we are looking for.

 
(return to problem 1b)

 


 

checkAnswer/Discussion to 1c

problem 1c
 

ad1c
*Inverse of add 5 is sub. 5

*Inverse of mult. by 6 is div. by 6

 
 

If you put 0 back in for y in the original problem you will see that 0 is the solution we are looking for.

 
(return to problem 1c)

 


 

checkAnswer/Discussion to 1d

problem 1d
 

ad1d
*Inverse of add 3x is sub. 3x
 

*Inverse of sub.  3 is add 3
 

*Inverse of mult. by 2 is div. by 2
 
 

If you put 5 back in for x in the original problem you will see that 5 is the solution we are looking for.

 
(return to problem 1d)

 


 

checkAnswer/Discussion to 2a

If x represents the first of three consecutive integers, express the sum of the three integers in terms of x.
 

First of all, we need to have all three consecutive integers in terms of x

We can represent them the following way:
 

x         = 1st integer

x + 1   = 2nd consecutive integer

x + 2   = 3rd consecutive integer

Second we need to write it as a sum of the three integers and then simplify it:
 

ad2a
*The sum of the three cons. integers
*Combine like terms

 
(return to problem 2a)

 

Buffalo Top

 

WTAMU > Virtual Math Lab >Beginning Algebra >Tutorial 13: Multiplication Property of Equality


Last revised on July 26, 2011 by Kim Seward.
All contents copyright (C) 2001 - 2011, WTAMU and Kim Seward. All rights reserved.