pdf, 54.07 KB
pdf, 54.07 KB
pdf, 26.33 KB
pdf, 26.33 KB
docx, 29.65 KB
docx, 29.65 KB

Two algorithms to finding lowest common multiple and highest common factors are presented. They are algorithms because they work but it is not explained why they do work. One is more of algebraic the other uses diagrammatic (Venn diagram) representation, which more approachable - hence recommended.

It is good idea to use the factor tree method for both algorithms.

Reviews

Something went wrong, please try again later.

This resource hasn't been reviewed yet

To ensure quality for our reviews, only customers who have purchased this resource can review it

Report this resourceto let us know if it violates our terms and conditions.
Our customer service team will review your report and will be in touch.