please solve the above question(only for Advanced Maths)
Attachments:
Answers
Answered by
2
Answer:
Inductive Step:
Assuming that this is true for n = k, Then it should be true for (k + 1) also,
3^(4(k+1) + 2) + 5^(2(k+1) + 1)
= 3^(4k+6) + 5^(2k+3)
= 3^4 * 3^(4k+2) + 5^2 * 5^(2k+1)
= 81 * 3^(4k+2) + 25 * 5^(2k+1)
= (25 + 56) * 3^(4k+2) + 25 * 5^(2k+1)
= 25 [3^(4k+2) + 5^(2k+1)] + 56 * 3^(4k+2).
By inductive hypothesis, 3^(4k+2) + 5^(2k+1) is divisible by 14.
Clearly, 56 * 3^(4k+2) = 14 * 4 * 3^(4k+2) is divisible by 14.
Therefore, 3^(4(k+1) + 2) + 5^(2(k+1) + 1)
= 25 [3^(4k+2) + 5^(2k+1)] + 56 * 3^(4k+2) is divisible by 14, completing the inductive step.
HOPE IT HELPS YOU ^_^
PLEASE MARK ME AS THE BRAINLIEST
Answered by
6
GIVEN
TO PROVE
• f(n) is divisible by 14
PROOF
Taking n = 1 we have ,
Similar questions
Hindi,
4 months ago
English,
4 months ago
Social Sciences,
10 months ago
Geography,
10 months ago
Biology,
1 year ago