Logo
Published on

Induction for a Divisibility Pattern Modulo Ten

Authors
  • avatar
    Name
    Vu Hung
    Twitter

Problem Statement

Prove by induction that 4n+1+6n4^{n+1} + 6^n is divisible by 1010 when nn is an even positive integer.


Hints

Since nn is even, let n=2kn = 2k for k1k \geq 1. Prove by induction on kk that 42k+1+62k4^{2k+1} + 6^{2k} is divisible by 1010.

For the inductive step:

  • Express 42(k+1)+1+62(k+1)4^{2(k+1)+1} + 6^{2(k+1)} as 1642k+1+3662k16 \cdot 4^{2k+1} + 36 \cdot 6^{2k}
  • From IH: 62k=10M42k+16^{2k} = 10M - 4^{2k+1} for some integer MM
  • Substitute and factor out 1010

Solutions

Since nn is an even positive integer, let n=2kn = 2k where kZ+k \in \mathbb{Z}^+.

We prove by induction on kk that P(k)P(k): "42k+1+62k4^{2k+1} + 6^{2k} is divisible by 1010" holds for all k1k \geq 1.

Base case (k=1k=1, i.e., n=2n=2):

42(1)+1+62(1)=43+62=64+36=100=10×104^{2(1)+1} + 6^{2(1)} = 4^3 + 6^2 = 64 + 36 = 100 = 10 \times 10

Divisible by 1010. \checkmark

Inductive hypothesis:

Assume P(k)P(k) holds: 42k+1+62k=10M4^{2k+1} + 6^{2k} = 10M for some integer MM.

From this: 62k=10M42k+16^{2k} = 10M - 4^{2k+1}

Inductive step:

Prove P(k+1)P(k+1): 42(k+1)+1+62(k+1)4^{2(k+1)+1} + 6^{2(k+1)} is divisible by 1010.

42(k+1)+1+62(k+1)=42k+3+62k+2=4242k+1+6262k=1642k+1+3662k\begin{aligned} 4^{2(k+1)+1} + 6^{2(k+1)} &= 4^{2k+3} + 6^{2k+2} \\ &= 4^2 \cdot 4^{2k+1} + 6^2 \cdot 6^{2k} \\ &= 16 \cdot 4^{2k+1} + 36 \cdot 6^{2k} \end{aligned}

Substitute 62k=10M42k+16^{2k} = 10M - 4^{2k+1} from IH:

=1642k+1+36(10M42k+1)=1642k+1+360M3642k+1=360M+(1636)42k+1=360M2042k+1=10(36M242k+1)\begin{aligned} &= 16 \cdot 4^{2k+1} + 36(10M - 4^{2k+1}) \\ &= 16 \cdot 4^{2k+1} + 360M - 36 \cdot 4^{2k+1} \\ &= 360M + (16 - 36) \cdot 4^{2k+1} \\ &= 360M - 20 \cdot 4^{2k+1} \\ &= 10(36M - 2 \cdot 4^{2k+1}) \end{aligned}

Since MM and 42k+14^{2k+1} are integers, 36M242k+136M - 2 \cdot 4^{2k+1} is an integer.

Therefore, 42(k+1)+1+62(k+1)4^{2(k+1)+1} + 6^{2(k+1)} is divisible by 1010. \checkmark

By the principle of mathematical induction, P(k)P(k) holds for all k1k \geq 1.

Therefore, 4n+1+6n4^{n+1} + 6^n is divisible by 1010 for all even positive integers nn. \blacksquare


Takeaways

  • Reconstruct the full proof from the hint and the solution outline, and justify every transformation explicitly.
  • Check edge cases and verify where each assumption is used in the argument.

Further Readings

If you found this proof interesting, be sure to check out these relevant HSC booklets to sharpen your reasoning skills:


Connect with me

If you're eager for more HSC Maths insights, be sure to check out my LinkedIn. For deeper dives and regular tips, join my GitHub. Let's tackle these challenging math problems together! You can also catch my daily math content on Substack.