Prove:
Using mathemetical induction:
P(n) = 
for n=1
P(n) = 
= 6
It is divisible by 2 and 3
Now, for n=k, 
P(k) = 
Assuming P(k) is divisible by 2 and 3:
Now, for n=k+1:
P(k+1) = 
P(k+1) = 
P(k+1) = 
Since, we assumed that P(k) is divisible by 2 and 3, therefore, P(k+1) is also
divisible by 2 and 3.
Hence, by mathematical induction, P(n) = is divisible by 2 and 3 for all positive integer n.
Answer:
yes
Step-by-step explanation:
by giving us a question and letting us answer it
Answer:
Step-by-step explanation
6n - 6 = 2 (n+1)
Simplify 2 (n+1)
6n - 6= 2n +2
Move all terms related to n to the left side of the equation
4n -6 =2
Move all terms not related to n to the right side of the equation
4n =8
Divide each term by 4 then simplify
n=2
Answer:
x = -3
Step-by-step explanation:
5x + 3 = 4x,
x + 3 = 0,
x = -3
Answer:
C. 1 - 2x > 13
Step-by-step explanation:
you just substitute
