(24n – 1) is divisible by 15 if and only if (24n – 1) is a multiple of 15.
Let P(n) ≡ (24n – 1) = 15m, where m ∈ N.
Step I:
Put n = 1
∴ 24(1) – 1 = 16 – 1 = 15
∴ (24n – 1) is a multiple of 15.
∴ P(n) is true for n = 1.
Step II:
Let us assume that P(n) is true for n = k.
∴ 24k – 1 = 15a, where a ∈ N
∴ 24k = 15a + 1 …..(i)
Step III:
We have to prove that P(n) is true for n = k + 1,
i.e., to prove that
∴ 24(k+1) – 1 = 15b, where b ∈ N
∴ P(k + 1) = 24(k+1) – 1 = 24k+4 – 1
= 24k . 24 – 1
= 16 . (24k) – 1
= 16(15a + 1) – 1 …..[From (i)]
= 240a + 16 – 1
= 240a + 15
= 15(16a + 1)
= 15b, where b = (16a + 1) ∈ N
∴ P(n) is true for n = k + 1.
Step IV:
From all the steps above, by the principle of mathematical induction, P(n) is true for all n ∈ N.
∴ (24n – 1) is divisible by 15, for all n ∈ N.