| A) Prime Number | |
|---|---|
| 1) Analyzing Prime Number Properties | Ex 1 Ex 2 Ex 3 Ex 4 Ex 5 |
| 2) Testing Primality and Bounding Prime Sequences | Ex 6 Ex 7 Ex 8 Ex 9 |
| 3) Solving Integer Equations through Factorization | Ex 10 Ex 11 Ex 12 Ex 13 |
| 4) Reasoning with Modular Arithmetic on Primes | Ex 14 Ex 15 |
| B) Prime Factorization | |
| 5) Analyzing Prime Factorization Properties | Ex 16 Ex 17 Ex 18 Ex 19 Ex 20 |
| 6) Decomposing into Prime Factors | Ex 21 Ex 22 Ex 23 Ex 24 |
| 7) Counting and Identifying Divisors | Ex 25 Ex 26 Ex 27 Ex 28 Ex 29 Ex 30 |
| 8) Solving Arithmetic Problems through Factorization | Ex 31 Ex 32 Ex 33 Ex 34 |
| C) Greatest Common Divisor (GCD) | |
| 9) Analyzing GCD Properties | Ex 35 Ex 36 Ex 37 Ex 38 Ex 39 Ex 40 |
| 10) Expressing Fractions in Simplest Form | Ex 41 Ex 42 Ex 43 Ex 44 |
| 11) Computing GCD using the Euclidean Algorithm | Ex 45 Ex 46 Ex 47 |
| 12) Modeling with GCD | Ex 48 Ex 49 Ex 50 |
| 13) Calculating GCD using Prime Factorization | Ex 51 Ex 52 Ex 53 |
| 14) Solving GCD Equations and Systems | Ex 54 Ex 55 Ex 56 |
| 15) Identifying Integers under GCD Constraints | Ex 57 Ex 58 |
| 16) Proving GCD Properties | Ex 59 Ex 60 |
| D) Least Common Multiple (LCM) | |
| 17) Analyzing LCM Properties | Ex 61 Ex 62 Ex 63 Ex 64 Ex 65 Ex 66 |
| 18) Calculating LCM using Prime Factorization | Ex 67 Ex 68 Ex 69 |
| 19) Modeling with GCD and LCM | Ex 70 Ex 71 Ex 72 |
| 20) Solving Equations and Systems using GCD and LCM | Ex 73 Ex 74 Ex 75 Ex 76 |