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:
Step-by-step explanation:
Please use " ^ " to indicate exponentiation: f(x) = x^2 and g(x) = (3x)^2.
g(x) can be rewritten as 9x^2.
The graph of g(x) is only one ninth as wide as that of f(x).
Next time please share the possible answer choices. Thank you.
An exponential function has a graph that is a smooth curve; it either increases at an ever increasing rate or decreases at an ever increasing rate. The only graph that fits these characteristics is the first one.
Okay I get some of them, your first one - 1 I disagree with. So we can solve with two points by using a equation y2-y1 over x2-x1. So it's 4-8 over - 3-6 with the numerator being - 4 and the denominator being - 9. Any questions on how to solve for slope with two coordinates.
Slope is -1/2
2-4/6-2=
-1/2
m=-1/2
