Applying Final Review in Number Theory

students, this lesson is a guided review of how to apply the big ideas from Number Theory when solving problems on a final assessment 📘✨. The goal is not just to remember definitions, but to choose the right theorem, spot patterns quickly, and explain why a method works. By the end of this lesson, you should be able to identify important tools, connect them to familiar examples, and use them in proof-style reasoning.

What “Applying Final Review” Means

In a final review, the phrase applying means using what you know in a new problem instead of only repeating memorized facts. In Number Theory, that often means working with divisibility, primes, factors, modular arithmetic, and proof methods such as direct proof, contradiction, and induction. The main skill is recognizing which idea fits the situation.

For example, if a problem asks whether a number can be written as a sum of multiples of $2$, then parity is likely involved. If a question asks whether two numbers leave the same remainder when divided by $n$, then modular arithmetic is the right tool. If a proof asks you to show that a statement is true for all natural numbers, induction may be the best strategy.

A useful mindset is: What is being asked? What structure is hidden here? What theorem matches that structure? This habit is central to final review because many exam problems are designed to test flexible thinking rather than one-step recall 🧠.

Core Tools You Should Be Ready to Apply

One of the most important review skills is knowing the standard building blocks of Number Theory and how they appear in problems.

Divisibility

A number $a$ divides a number $b$ if there exists an integer $k$ such that $b = ak$. This is written as $a \mid b$. Divisibility problems often ask you to prove that one expression is a multiple of another. A classic way to do this is to rewrite the expression until the factor appears.

Example: Show that $6 \mid (n^3-n)$ for every integer $n$.

A strong strategy is factoring:

$$n^3-n = n(n^2-1)=n(n-1)(n+1).$$

These are three consecutive integers, so one of them is even and one of them is divisible by $3$. Therefore their product is divisible by $2$ and by $3$, so it is divisible by $6$.

This example shows how applying final review often means combining ideas instead of using just one theorem.

Prime Numbers and Factorization

A prime number is an integer greater than $1$ whose only positive divisors are $1$ and itself. The Fundamental Theorem of Arithmetic says every integer greater than $1$ can be written uniquely as a product of primes, up to the order of the factors.

This matters in review because many problems depend on prime factorization. For instance, to find the greatest common divisor $\gcd(a,b)$ or the least common multiple $\operatorname{lcm}(a,b)$, factorization gives a clear path.

Example: Find $\gcd(84,126)$.

Factor each number:

$$84 = 2^2 \cdot 3 \cdot 7, \qquad 126 = 2 \cdot 3^2 \cdot 7.$$

The common prime factors are $2^1$, $3^1$, and $7^1$, so

$$\gcd(84,126)=2\cdot 3\cdot 7=42.$$

This kind of question tests whether students can move from definitions to a structured computation.

Modular Arithmetic

Congruence is a major review topic. We say $a \equiv b \pmod{n}$ if $n \mid (a-b)$. This means $a$ and $b$ leave the same remainder when divided by $n$.

Modular arithmetic is powerful because it simplifies large numbers. For example, to compute $7^{100} \pmod{6}$, notice that $7 \equiv 1 \pmod{6}$, so

$$7^{100} \equiv 1^{100} \equiv 1 \pmod{6}.$$

This is much easier than multiplying out a huge power.

Final review questions often ask you to use modular arithmetic to prove impossibility. For example, a number that is congruent to $1 \pmod{2}$ is odd, so it cannot be even. Patterns like these are useful for checking whether a statement can even be true.

Proof Strategies in Action

Proofs are a major part of final review because they reveal whether you understand the logic behind the tools. A strong proof does more than show an answer; it explains why the answer must be correct.

Direct Proof

A direct proof starts with the assumptions and uses logical steps to reach the conclusion. Suppose you need to prove that if $n$ is even, then $n^2$ is even. Since $n$ is even, write $n=2k$ for some integer $k$. Then

$$n^2=(2k)^2=4k^2=2(2k^2),$$

so $n^2$ is even.

This is a classic direct proof because it uses the definition of evenness.

Proof by Contradiction

A contradiction proof assumes the opposite of what you want to prove and shows this leads to something impossible. A well-known example is proving that $\sqrt{2}$ is irrational.

The key idea is to assume $\sqrt{2} = \frac{a}{b}$ in lowest terms, with integers $a$ and $b$. Squaring gives $2b^2=a^2$, so $a^2$ is even and therefore $a$ is even. Let $a=2k$. Substituting back gives $2b^2=4k^2$, so $b^2=2k^2$, meaning $b$ is even too. But then both $a$ and $b$ are even, which contradicts that $\frac{a}{b}$ was in lowest terms.

This proof is useful in final review because it combines definitions, factor reasoning, and logical structure.

Mathematical Induction

Induction is used to prove statements for all natural numbers. It has two parts: the base case and the inductive step. A common structure is:

Show the statement is true for $n=1$ or another starting value.
Assume it is true for $n=k$.
Prove it is true for $n=k+1$.

Example: Prove that

$$1+2+\cdots+n=\frac{n(n+1)}{2}.$$

This is a standard formula, and induction confirms it for all natural numbers.

Induction appears often in final review because it connects algebraic manipulation with proof structure. It also shows how a statement can be verified indefinitely using a finite argument.

Connecting Skills Across the Topic

Applying final review means seeing connections between different Number Theory ideas.

For instance, divisibility and modular arithmetic are closely linked. If $a \equiv b \pmod{n}$, then $n \mid (a-b)$. So a congruence statement is really a divisibility statement in disguise. This connection is useful when converting a problem into a proof.

Another connection is between factorization and gcd/lcm. If two numbers share prime factors, then the gcd uses the smallest shared powers and the lcm uses the largest powers. This is not just a calculation trick; it reflects the structure of integer arithmetic.

Parity is another recurring theme. Since every integer is either even or odd, many proofs split into cases. Example: the product of two odd numbers is odd because if $a=2m+1$ and $b=2n+1$, then

$$ab=(2m+1)(2n+1)=2(2mn+m+n)+1,$$

which is odd.

These connections matter because final review questions often blend several topics into one problem. students should practice asking, “Which concept is the hidden engine here?” 🔍

Example of a Full Review-Style Problem

Consider the statement: If $n$ is odd, then $n^2$ is odd.

A strong review answer begins with the definition of odd. Since $n$ is odd, write

$$n=2k+1$$

for some integer $k$. Then

$$n^2=(2k+1)^2=4k^2+4k+1=2(2k^2+2k)+1.$$

Because this has the form $2m+1$, it is odd.

This example is simple, but it shows the exact pattern used in many final review proofs:

state the definition,
substitute the definition into the expression,
simplify carefully,
identify the resulting structure.

That sequence is a reliable method for many exam questions in Number Theory.

Conclusion

Applying final review in Number Theory means using definitions, theorems, and proof methods together in a flexible way. The big ideas include divisibility, primes, factorization, gcd and lcm, congruence, parity, and proof techniques such as direct proof, contradiction, and induction. When students practices connecting these ideas, it becomes easier to solve new problems and explain solutions clearly. Final review is not just about remembering facts; it is about building a toolkit and knowing when to use each tool.

Study Notes

$a \mid b$ means there is an integer $k$ such that $b=ak$.
$a \equiv b \pmod{n}$ means $n \mid (a-b)$.
Every integer greater than $1$ has a unique prime factorization.
The gcd uses the common prime factors with the smallest powers.
The lcm uses all prime factors with the largest powers.
An even number has the form $2k$; an odd number has the form $2k+1$.
A direct proof starts from the hypothesis and works to the conclusion.
A contradiction proof assumes the opposite and shows an impossibility.
Induction proves statements for all natural numbers using a base case and inductive step.
Many review problems connect multiple ideas, so students should look for hidden structure before starting calculations.