Answer:
obviously it's always gonna be hyperbola lol
Answer:
A. The variation between the sample means is small.
Step-by-step explanation:
I took the quiz and got it right. O gotchu fam
Answer:

Step-by-step explanation:
We will prove by mathematical induction that, for every natural n,

We will prove our base case (when n=1) to be true:
Base case:
As stated in the qustion, 
Inductive hypothesis:
Given a natural n,

Now, we will assume the inductive hypothesis and then use this assumption, involving n, to prove the statement for n + 1.
Inductive step:
Let´s analyze the problem with n+1 stones. In order to move the n+1 stones from A to C we have to:
- Move the first n stones from A to C (
moves). - Move the biggest stone from A to B (1 move).
- Move the first n stones from C to A (
moves). - Move the biggest stone from B to C (1 move).
- Move the first n stones from A to C (
moves).
Then,
.
Therefore, using the inductive hypothesis,

With this we have proved our statement to be true for n+1.
In conlusion, for every natural n,

Number 2.
number 3.
number 5.
are all true
The correct answer is B: y ≥ 1/3x - 1
(0,0) ⇒ within the shaded area
0 ≥ 1/3(0) - 1
0 ≥ 0 - 1
0 ≥ -1
True
(0, -3) ⇒ not within the shaded area
-3 ≥ 1/3(0) -1
-3 ≥ 0 - 1
-3 ≥ -1
False