[Introduction to Number Theory Series Part 20] Where Is Number Theory Used, and What Should You Study Next?

This series began with divisibility and moved through gcds, primes, congruence, Fermat's little theorem, and Euler's theorem. In this final post, we gather that path into one picture and ask where number theory is used next.

What this post covers

• A four-stage summary of the 20-part series
• How number theory connects to algorithms and RSA-style cryptography
• Natural next study directions after an introductory course
• A practical way to review the series as a connected structure

Key terms

• RSA: a public-key cryptosystem based on modular arithmetic and the difficulty of factoring large composite numbers
• cryptography: the study of secure communication and information protection
• congruence: equality of remainder classes
• prime number: a basic building block of integers

The big flow of the 20-part series

1. The basic structure of integers

• divisibility
• greatest common divisor
• Euclidean algorithm

This stage taught us how to read the fundamental relations among integers.

2. Integer solutions and prime structure

• Bézout's identity
• linear Diophantine equations
• primes
• prime factorization

This stage connected integer-solution problems with the internal structure of integers.

3. The world of congruence

• congruence
• modular arithmetic
• modular inverses
• Chinese remainder theorem

This stage gave us the language of remainders and the basic tools for solving modular problems.

4. Theorems and extensions

• Fermat's little theorem
• Euler's theorem
• arithmetic functions
• quadratic residues

This stage showed how the subject extends into deeper structure and practical applications.

Where is number theory used?

1. Cryptography

A famous example is RSA. RSA depends on:

• the computational difficulty of factoring large composite numbers
• modular arithmetic
• Euler's totient function and Euler's theorem

So introductory number theory is already close to real cryptographic systems.

2. Algorithms

The Euclidean algorithm, fast exponentiation, inverse computation, and primality-related methods all appear naturally in programming and algorithm design.

3. Mathematical thinking

Number theory is excellent training for reading conditions carefully:

• Why does coprimality matter here?
• Why must the modulus be prime there?
• Why does an integer-solution condition appear at all?

Those habits matter across mathematics.

What should you study next?

1. Deeper number theory

You can continue toward:

• prime distribution
• more advanced Diophantine equations
• quadratic reciprocity and beyond

2. Abstract algebra

Groups, rings, and fields provide a broader language for the structural ideas that already appeared in this series.

3. Algorithms and cryptography

If you like implementation, good next steps include:

• fast exponentiation
• the extended Euclidean algorithm
• implementing RSA

How should you review the series?

It is usually better to review the connections than isolated formulas:

• divisibility → gcd → Euclidean algorithm
• gcd → Bézout → Diophantine equations
• primes → factorization → the fundamental theorem of arithmetic
• congruence → modular arithmetic → inverses → CRT
• Fermat → Euler

Once these arrows are clear, number theory stops feeling like disconnected topics.

Wrap-up

This series showed how number theory grows from basic divisibility into primes, congruence, modular theorems, arithmetic functions, and applications such as cryptography.

Number theory begins with small integers, but the structure inside them reaches very far. If this series has helped turn that structure into a clear map, then it has done its job.