
Objective and Summary:
SWBAT generate equivalent expressions using the fact that addition and multiplication can be done in any order and any grouping
Call Collect--Rewrite the following expression by collecting like terms.
Show each step of your work on FORMATIVE'S SYW
CFS:
#1: Accurately identifies like terms
#2: Accurately rewrites expression in standard form by collecting like terms
Collect 2--Rewrite the following expression by collecting like terms.
Show each step of your work on FORMATIVE'S SYW
CFS:
#1: Accurately identifies like terms
#2: Accurately rewrites expression in standard form by collecting like terms
Equivalent--Rewrite the following expression by collecting like terms.
Show each step of your work on FORMATIVE'S SYW
CFS:
#1: Accurately identifies like terms
#2: Accurately rewrites expression in standard form by collecting like terms
Equivalent 2--Rewrite the following expression by collecting like terms.
Show each step of your work on FORMATIVE'S SYW
CFS:
#1: Accurately identifies like terms
#2: Accurately rewrites expression in standard form by collecting like terms
Equivalent 3--Rewrite the following expression by collecting like terms.
Show each step of your work.
Show each step of your work on FORMATIVE'S SYW
CFS:
#1: Accurately identifies like terms
#2: Accurately rewrites expression in standard form by collecting like terms
SPICY--Try if you have time.
Smartest Brother?--Babel says that
Do you agree with him? Explain why or why not.
"I (agree / disagree) with Babel because..."
CFS:
#1: Accurately identifies like terms
#2: Accurately rewrites expression in standard form by collecting like terms
SPICY--Try if you have time.
Now with Fractions!--Rewrite the expression by combining like terms. The rules are the same even if you have fractions for coefficients.
CFS:
#1: Accurately identifies like terms
#2: Accurately rewrites expression in standard form by collecting like terms
Equivalent--Rewrite the following expression by collecting like terms.
Show each step of your work for full credit.
CFS:
#1: Accurately identifies like terms
#2: Accurately rewrites expression in standard form by collecting like terms