Divisibility and Primes
Exploration of the division algorithm, greatest common divisors, the Euclidean algorithm, and the Fundamental Theorem of Arithmetic.
About This Topic
Exploration of the division algorithm, greatest common divisors, the Euclidean algorithm, and the Fundamental Theorem of Arithmetic.
Key Questions
- How does the Euclidean algorithm find the greatest common divisor efficiently?
- What are the unique properties of prime numbers?
- How do we prove the infinitude of primes?
Active Learning Ideas
See all activities→Activities & Teaching Strategies
See all activities
Planning templates for Mathematics
5E Model
The 5E Model structures lessons through five phases (Engage, Explore, Explain, Elaborate, and Evaluate), guiding students from curiosity to deep understanding through inquiry-based learning.
Unit PlannerMath Unit
Plan a multi-week math unit with conceptual coherence: from building number sense and procedural fluency to applying skills in context and developing mathematical reasoning across a connected sequence of lessons.
RubricMath Rubric
Build a math rubric that assesses problem-solving, mathematical reasoning, and communication alongside procedural accuracy, giving students feedback on how they think, not just whether they got the right answer.