91Ó°ÊÓ

Congruence relation is a fundamental concept in modular arithmetic.
It describes how two numbers leave the same remainder when divided by a third number, known as the modulus.
If we say that two integers, for example, a and b, are congruent modulo m, we write this as: \(\text{a} \equiv \text{b} \ (\bmod \ \text{m}) \).
Mathematically, it means that when you subtract b from a, the result is a multiple of m, or \(\text{a} - \text{b} = \text{qm}\text{ for some integer q}\).
This relationship is useful when solving problems where numbers need to be simplified and compared under a modular system.
Applying this understanding becomes especially handy in more advanced proofs involving integer powers.

Mathematical induction is a powerful technique used to prove statements about integers.
The process is akin to falling dominos; if you can knock down the first one, and show that each one knocks down the next, all will fall.
Here is how it works:
- **Base Case:** Verify that the statement holds for the initial value, usually k = 1.
- **Inductive Step:** Assume the statement holds for some integer k = k_0 (This is called the induction hypothesis). Then, prove it holds for k = k_0 + 1.
The idea is if the base case is true, and if the statement holding for k _0 implies it also holds for k _0 + 1, the statement is true for all integers k starting from the base case.
This principle was used to prove that \(\text{a}^{k} \equiv \text{b}^{k}\text{(mod } \text{m})\). Initial value was checked for k = 1. The hypothesis was then assumed for some arbitrary k = k_0, and shown valid for k_0 + 1.

Integer powers extend basic arithmetic into repeated multiplication.
For example, \(\text{a}^{k}\) means multiplying a by itself k times.
In modular arithmetic, working with powers of integers can simplify complex calculations. For instance, when proving \(\text{a}^{k} \equiv \text{b}^{k}\text{(mod }\text{m})\), it involves both power operations and modular reductions.
Since we know that \( \text{a} \equiv \text{b}\text{(mod }\text{m})\), by definition \(\text{a}\text{ and } \text{b}\) leave the same remainders when divided by m. Utilizing this property, we can raise them to any integer power k and they will maintain the same congruence modulo m. This is made precise using the steps of mathematical induction.
The concept of raising both sides of a congruence to power k works because of the inherent properties of congruence relations which distribute through multiplication.