Advertisements
Advertisements
Question
Prove that 2n + 6 × 9n is always divisible by 7 for any positive integer n
Advertisements
Solution
21 + 6 × 91 = 2 + 54 = 56 is divisible by 7
When n = k,
2k + 6 × 9k = 7m .....[where m is a scalar]
⇒ 6 × 9k = 7m – 2k …(1)
Let us prove for n = k + 1
Consider 2k+1 + 6 × 9k+1 = 2k+1 + 6 × 9k × 9
= 2k+1 + (7m – 2k)9 ..........(using (1))
= 2k+1 + 63m – 9.2k = 63m + 2k.21 – 9.2k
= 63m – 2k (9 – 2) = 63m – 7.2k
= 7(9m – 2k) which is divisible by 7
∴ 2n + 6 × 9n is divisible by 7 for any positive integer n
APPEARS IN
RELATED QUESTIONS
Find the least positive value of x such that 71 ≡ x (mod 8)
Find the least positive value of x such that 78 + x ≡ 3 (mod 5)
Find the least positive value of x such that 96 ≡ `x/7` (mod 5)
Find the least positive value of x such that 5x ≡ 4 (mod 6)
If x is congruent to 13 modulo 17 then 7x – 3 is congruent to which number modulo 17?
Solve 5x ≡ 4 (mod 6)
Solve 3x – 2 ≡ 0 (mod 11)
Today is Tuesday. My uncle will come after 45 days. In which day my uncle will be coming?
Find the remainder when 281 is divided by 17.
74k ≡ _____ (mod 100)
