Number theory is the study of integers, the whole numbers we use every day. At its heart, it's about understanding the relationships between them. The most basic of these building blocks are the prime numbers.

Think of primes as the atoms of the number world. Just as all matter is made of elements from the periodic table, all integers greater than 1 are either prime numbers themselves or can be built by multiplying prime numbers together. The numbers 2, 3, 5, 7, 11, and 13 are the first few primes.

Numbers that aren't prime, like 4, 6, 8, and 9, are called composite numbers. Every composite number can be broken down into a unique product of primes. This is a cornerstone idea called the Fundamental Theorem of Arithmetic. It means that no matter how you break down a number, you'll always end up with the same set of prime factors.

For example, let's take the number 42. We can see it's 6 times 7. The number 7 is prime, but 6 is not. We can break 6 down into 2 times 3. Both 2 and 3 are prime. So, the prime factorization of 42 is $2 \times 3 \times 7$. There is no other combination of prime numbers that will multiply to 42.

Once we understand how numbers are built from primes, we can start looking at how they relate to each other. One key relationship is divisibility. If you can divide one integer by another without a remainder, we say the first is divisible by the second. For example, 18 is divisible by 6, but not by 5.

This leads us to the idea of a greatest common divisor, or GCD. The GCD of two numbers is the largest number that divides both of them evenly.

Listing all the factors works for small numbers, but it's not practical for large ones. A much more powerful method is the Euclidean Algorithm. It's a step-by-step process that quickly finds the GCD of any two integers.

Here's how it works for GCD(48, 18):

1. Divide 48 by 18: $48 = 2 \times 18 + 12$. The remainder is 12.
2. Now, divide the previous divisor (18) by the remainder (12): $18 = 1 \times 12 + 6$. The new remainder is 6.
3. Repeat the process: $12 = 2 \times 6 + 0$. The remainder is now 0, so we stop.

The last non-zero remainder is our answer. The GCD of 48 and 18 is 6.

Imagine a clock. The hours go from 1 to 12, and then they start over. If it's 9 o'clock now, what time will it be in 5 hours? You'd add $9 + 5 = 14$. But there's no 14 on a clock. It would be 2 o'clock. This is the essence of modular arithmetic.

Modular arithmetic deals with remainders. In our clock example, we are working "modulo 12". When we divide 14 by 12, we get a remainder of 2. In mathematical terms, we write this as:

The $\equiv$ symbol means "is congruent to". This expression says that 14 and 2 have the same remainder when divided by 12. This concept is incredibly useful in number theory. It simplifies complex problems by allowing us to work with a finite set of numbers (0, 1, 2, ..., 11 in our clock example) instead of all integers.

For example, is $367 \times 412$ an even or odd number? We could multiply it out, or we could use modular arithmetic. An even number is any number congruent to 0 (mod 2), and an odd number is congruent to 1 (mod 2).

$367 \equiv 1 \pmod{2}$ (since it's odd) $412 \equiv 0 \pmod{2}$ (since it's even)

So, $367 \times 412 \equiv 1 \times 0 \equiv 0 \pmod{2}$. The product is even.

Now let's combine these ideas to look at a special type of equation. A Diophantine equation is a polynomial equation where we are only interested in integer solutions. They are named after the ancient Greek mathematician Diophantus.

The simplest type is a linear Diophantine equation, which looks like this:

Here, $a$, $b$, and $c$ are given integers, and we need to find integer values for $x$ and $y$ that make the equation true.

For example, consider the equation $6x + 10y = 22$. We're looking for whole number pairs $(x, y)$ that work. One solution is $x=2, y=1$, because $6(2) + 10(1) = 12 + 10 = 22$. Another is $x=-3, y=4$, because $6(-3) + 10(4) = -18 + 40 = 22$.

An interesting fact connects these equations to our earlier topic: an equation $ax+by=c$ only has integer solutions if $c$ is divisible by the greatest common divisor of $a$ and $b$. For our example, GCD(6, 10) = 2. Since 22 is divisible by 2, we know solutions exist.

Diophantine equations can be much more complex, involving higher powers like $x^2 + y^2 = z^2$. Finding integer solutions to these equations is a central challenge in number theory and has fascinated mathematicians for centuries.

These concepts are the foundation upon which much of number theory is built. Understanding them is the first step toward exploring some of the deepest and most beautiful results in mathematics.