Number Properties: Remainders, GCD, LCM & Primes
This lesson is part of the course
In this lesson
You solve a remainder problem with MOD, run Euclid's algorithm for the greatest common divisor, get the least common multiple from it and test a number for primality with a table of remainders.
Buy the course once for $9.99 to unlock every lesson and lab, the final exam and the certificate – lifetime access, no subscription.
Lessons in this course
- Percentages & Successive Changes Locked
- Ratios, Mixtures & Alligation Locked
- Rates & Work: Combined Work, Pipes & Relative Speed Locked
- Simple & Compound Interest: The Trap Answers Locked
- Statistics: Means, Weighted Averages & Standard Deviation Locked
- Counting & Probability: Quick Problems Locked
- Number Properties: Remainders, GCD, LCM & Primes Locked
- Data Interpretation: Multi-Step Questions from a Table & Chart Locked