91Ó°ÊÓ

Prime numbers are like the atoms of mathematics. They are fundamental numbers that cannot be divided evenly by any number other than 1 and themselves. That means when you multiply any two smaller natural numbers, you cannot get a prime number. For example, 2, 3, 5, 7, 11 are all prime numbers because they meet this criterion.
The uniqueness of prime numbers is crucial in various areas of mathematics, including number theory and cryptography. Each number greater than 1 is either a prime or can be factored into a product of primes, which is known as the Fundamental Theorem of Arithmetic.
Understanding prime numbers helps when working with the Euler Totient function, specifically when proving statements such as the one in our exercise, where \(\) is a prime number if \(\) meets certain conditions.

Two numbers are said to be coprime if they have no common factors other than 1; their greatest common divisor (GCD) is 1. This makes detecting coprime numbers fairly straightforward. For instance, 8 and 15 are coprime because their only shared divisor is 1.
The concept is central in the Euler Totient function, \(u(n)\) , which counts how many integers are coprime with \(n\).
The idea of coprimeness helps simplify many mathematical problems, especially those involving modular arithmetic and cryptography. When analyzing properties about numbers, checking for coprime relationships can sometimes reveal further structure or simplicity.

The greatest common divisor is the largest number that divides two numbers without leaving a remainder. Finding the GCD of two numbers is a vital step in simplifying fractions or determining relationships between numbers.
For instance, the GCD of 14 and 28 is 14 because 14 is the largest number that divides both evenly. To calculate the GCD, a common method used is the Euclidean algorithm, which involves repeated division and taking remainders.
In the context of our given exercise, understanding the concept of GCD helps in determining which numbers are coprime to \(n\). If \(\text{GCD}(a,n) = 1\), then \(a\) is coprime to \(n\), essential in calculating the Euler Totient function and eventually proving if a number \(n\) is prime.