How can I solve this?
1 answer:
You might be interested in
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:
Table is attached with values, but answers are:
(0, 0) (1, 3) (2, 6) (3, 9)
Step-by-step explanation:
y = 3x
Substitute all values.
y = 3(0)
y = 0
0, 0
y = 3(1)
y = 3
1, 3
y = 3(2)
y = 6
2, 6
y = 3(3)
y = 9
3, 9
