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:
Hope this helps
Step-by-step explanation:
We don’t see nothing or no image
Answer:
$12.15/3
3 games
$4.05
It would cost $4.05 per game.
Step-by-step explanation:
T= total played
e= # evenings played
m= # minutes played
Total equals number of evenings played multiplied by number of minutes plated per evening.
EQUATION:
t=e * m
EQUATION (if 30 minutes per evening):
t=30e
Example:
3 nights, 30 minutes played
t= 3 * 30
t=90 minutes total played
Hope this helps! :)