STATEMENT: An odd integer raise to a positive even integer is congruent to 1 (𝑚𝑜𝑑 8).

PATTERN GETTING:

Table 1: The table for 𝑎𝑏 ≡ 1 (𝑚𝑜𝑑 8)

𝑎 𝑏 𝑎𝑏 𝑎𝑏 ≡ 1 (𝑚𝑜𝑑 8)
-9 5 -59049 𝐹𝑎𝑙𝑠𝑒
-6 2 36 𝐹𝑎𝑙𝑠𝑒
-5 4 625 𝑇𝑟𝑢𝑒
-2 3 -8 𝐹𝑎𝑙𝑠𝑒
3 8 6561 𝑇𝑟𝑢𝑒
8 2 64 𝐹𝑎𝑙𝑠𝑒
15 2 225 𝑇𝑟𝑢𝑒
20 3 8000 𝐹𝑎𝑙𝑠𝑒
21 2 441 𝑇𝑟𝑢𝑒
23 3 12166 𝐹𝑎𝑙𝑠𝑒
26 2 675 𝐹𝑎𝑙𝑠𝑒

The table above shows the relationship of an integer raise to positive integer
congruence 1 (𝑚𝑜𝑑 8). We want to limit 𝑏 to a positive integer to avoid getting a fraction.
Observe that only an odd integer raise to a positive even integer will make the congruence
true.

Table 2: Simplified Table 1

𝑎 𝑏 𝑎𝑏 𝑎𝑏 ≡ 1 (𝑚𝑜𝑑 8)
-5 4 625 𝑇𝑟𝑢𝑒
3 8 6561 𝑇𝑟𝑢𝑒
15 2 225 𝑇𝑟𝑢𝑒
21 2 441 𝑇𝑟𝑢𝑒

Simplifying the table 1 we will get the depicted table above. By limiting the value
of 𝑎 to any odd integer while 𝑏 to any positive even integer the congruence will be true.
We want to know if it is true for all 𝑎 odd integer and 𝑏 positive even integer.

CONJECTURE: For any 𝑎 odd integer and 𝑏 positive even integer, 𝑎𝑏 ≡ 1 (𝑚𝑜𝑑 8).

PROOF:

Remark 1:
 In order to prove it we must first prove that 𝑎2 ≡ 1 (𝑚𝑜𝑑 8) for any 𝑎 odd integer.

Let 𝑎 be any odd integer show that 𝑎2 ≡ 1 (𝑚𝑜𝑑 8).

Thus,

𝑎 = 2𝑘 + 1 ,𝑘∈𝑍

It follows that

(2𝑘 + 1)2 ≡ 1 (𝑚𝑜𝑑 8) ⇔ (2𝑘 + 1)2 − 1 = 8𝑙 , 𝑙 ∈ 𝑍

⇔ 4𝑘 2 + 4𝑘 + 1 − 1 = 8𝑙

⇔ 4𝑘 2 + 4𝑘 = 8𝑙

⇔ 4𝑘(𝑘 + 1) = 8𝑙

⇔ 𝑘(𝑘 + 1) = 2𝑙
∈ℤ

Since 𝑘 and 𝑘 + 1 are 2 consecutive integer. Then either

of the 2 is an even number, thus 𝑘(𝑘 + 1) = 2𝑙 will be
true.

Therefore 𝑎2 ≡ 1 (𝑚𝑜𝑑 8) for any 𝑎 odd integer. █

Remark 2:

The product of 2 odd integers is always an odd integer.

Let 𝑎, 𝑏 be any odd integers.

Thus,

𝑎 = 2𝑘 + 1 ,𝑘∈𝑍 (1)

𝑏 = 2𝑗 + 1 ,𝑗∈𝑍 (2)

Multiplying (1) and (2) we get

𝑎𝑏 = (2𝑘 + 1)(2𝑗 + 1)

= 2𝑘𝑗 + 2𝑘 + 2𝑗 + 1

= 2(𝑘𝑗 + 𝑘 + 𝑗) + 1 █

∈ℤ

Remark 3:

Note that an odd integer raise to a power yields an odd integer.

 Proof by Mathematical Induction

Show that for all 𝑘 ∈ 𝑍 and 𝑛 ∈ 𝑍 >0 , (2𝑘 + 1)𝑛 will always be an odd
integer.

Let 𝑃(𝑛) denote the statement (2𝑘 + 1)𝑛 is an odd

integer for all 𝑘 ∈ 𝑍 and 𝑛 ∈ 𝑍 >0 .

Base Step:

Show 𝑃(1) is true.

(2𝑘 + 1)1 ⇔ 2𝑘 + 1

Since 2k+1 is an odd integer for all 𝑘 ∈ 𝑍, 𝑃(1) holds.

Inductive Step:

Assume 𝑃(𝑚) is true for all 𝑛 ∈ 𝑍 >0 .

Thus, (2𝑘 + 1)𝑚 is an odd integer.

Show 𝑃(𝑚 + 1) is true.

(2𝑘 + 1)𝑚+1 ⇔ (2𝑘 + 1)𝑚 (2𝑘 + 1)

By Remark 2 the product of 2 odd integer is an

odd integer.

Therefore (2𝑘 + 1)𝑛 is an odd integer for all 𝑘 ∈ 𝑍 and 𝑛 ∈ 𝑍 >0 . █

Actual Proof:

Let 𝑎 be any odd integer and 𝑏 be any positive even integer, show that 𝑎𝑏 ≡ 1 (𝑚𝑜𝑑 8).
 Thus,

𝑎 = 2𝑘 + 1 ,𝑘∈𝑍

𝑏 = 2𝑗 , 𝑗 ∈ 𝑍 ≥0

It follows that

(2𝑘 + 1)2𝑗 ≡ 1 (𝑚𝑜𝑑 8) ⇔ [(2𝑘 + 1)𝑗 ]2 ≡ 1 (𝑚𝑜𝑑 8)

By Remark 3, (2𝑘 + 1)𝑗 is an odd integer. Also by Remark 2, an

odd integer raise to 2 is congruent to 1 (𝑚𝑜𝑑 8).

Therefore 𝑎𝑏 ≡ 1 (𝑚𝑜𝑑 8) for all 𝑎 odd integer and 𝑏 positive even integer.█