Skip to content
CCC Python Course

Number theory I

Stage
4
Module
M4.6
Lessons
1

In this module

  • Determine whether a number is prime and find the smallest prime factor.
  • Calculate GCD and LCM using Euclid's algorithm and explain why it works.
  • Recognize when a problem needs modular arithmetic and apply it correctly.
  • Use trial division to factor a number and count divisors efficiently.

Before this module

M1.2Integer arithmetic and operatorsM2.5Brute force and complete search

Lessons

  1. 1Number theory I

Practice

Try these on the judge. Each link opens the problem on WMOJ.

  1. 2022 J3
    Harp Tuning (opens on WMOJ in a new tab) WMOJ

    Count how many pairs of heights in a list share a common factor.

  2. 2021 J4
    Arranging Books (opens on WMOJ in a new tab) WMOJ

    Determine the least common multiple of two numbers to time events.