Answers>Maths>IB>Article

Prove 2^(n+2) + 3^(2n+1) is a multiple of 7 for all positive integers of n by mathematical induction.

Let P(n) be the proposition that 2n+2 + 32n+1 is a multiple of 7 for all positive integers of n.
Let n=123 + 33 = 8 + 27 = 35 = 7(5)This is divisible by 7.
Assume n=k2k+2 + 32k+1 = 7m
The above equation can be rearranged to 2k+2 = 7m - 32k+1, which will become useful later.
Test n=k+12(k+1)+2 + 32(k+1)+12k+3 + 32k+32(2k+2)+ 32k+32(7m - 32k+1)+ 32k+3 The above step is done using the rearrangement of the equation from the 'assume n=k' section. 14m - 2(32k+1) + 9(32k+1)14m + 7(32k+1)7(2m + 32k+1)The above is divisible by 7.
As P(1) was shown to be true, and when n=k was assumed true, P(k+1) was proven true, P(n) has been proven true for all positive integers of n by the principle of mathematical induction.

EP

Related Maths IB answers

All answers ▸

Prove by mathematical induction that (2C2)+(3C2)+(4C2)+...+(n-1C2) = (nC3).


Given the function f(x)=λx^3 + 9, for λ other than zero, find the inflection point of the graph in terms of λ. How does the slope of the line tangent to the inflection point changes as λ varies from 0 to 1?


Integrate cos(2x)sin(2x)


Determine the integral: ∫5x^4dx