Teacher resources and professional development across the curriculum

Teacher professional development and classroom resources across the curriculum

Monthly Update sign up
Mailing List signup
Search
Follow The Annenberg Learner on LinkedIn Follow The Annenberg Learner on Facebook Follow Annenberg Learner on Twitter
MENU
Learning Math Home
Patterns, Functions, and Algebra
 
Session 3 Part A Part B Part C Part D Part E Homework
 
Glossary
Algebra Site Map
Session 3 Materials:
Notes
 

A B C D E

Solutions
Video

Notes for Session 3, Part D


Note 5

Groups: Work on Problems D1-D7 and discuss what everyone finds.

The problem with the algorithm in Problem D3 is the step "add your original number." It's not clear how to model that with machines. Even if we are able to adapt the machine metaphor to work, we can't "undo" that step of the process.

Consider going through a symbolic representation of the algorithm to see that it does not share this weakness with the machine, because you can combine terms, essentially creating an equivalent algorithm that you can undo:

[(n + 3) x 2 + n - 4] x 3 = (3n + 6 - 4) x 3

(This is just one of many equivalent algorithms.)

<< back to Part D: Number Games

 

Learning Math Home | Algebra Home | Glossary | Map | ©

Session 3: Index | Notes | Solutions | Video

© Annenberg Foundation 2014. All rights reserved. Legal Policy