Show that 1n^ 3 + 2n + 3n ^2 is divisible by 2 and 3 for all positive integers n.
1 answer:
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.
You might be interested in
Answer: (a-2b)3=3a-6b
=3x-2-6x-1/2
= -6+3
= -3
Step-by-step explanation:
Answer:
the slope is -1
Step-by-step explanation:
rise over run
Answer:
48 minutes
Step-by-step explanation:
Pete: 3 hours = 2 hours 60 minutes
Sheila: 2 hours 60 minutes - 55 minutes = 2 hours 5 minutes = 1 hour 65 minutes
Mark: 1 hour 65 minutes - 1 hour 17 minutes = 48 minutes
Look up on google to find out the answer that’s how I get mine
Do you know your trig ratios?