Answer:
1.2
Step-by-step explanation:
Step-by-step explanation:
We will prove by mathematical induction that, for every natural ,
We will prove our base case, when n=4, to be true.
Base case:
Inductive hypothesis:
Given a natural ,
Now, we will assume the induction hypothesis and then use this assumption, involving n, to prove the statement for n + 1.
Inductive step:
With this we have proved our statement to be true for n+1.
In conlusion, for every natural .
Answer:
Option B
Step-by-step explanation:
<u>Option A
</u>
In order to make a triangle: a + b > c and b + c > a and c + a > b
2 is a, 6 is b, and 1 is c
a + b > c
2 + 6 > 1
8 > 1 -> <em>TRUE
</em>
b + c > a
6 + 1 > 2
7 > 2 -><em> TRUE
</em>
c + a > b
1 + 2 > 6
3 > 6 -> <em>FALSE
</em>
<u>Option B
</u>
In order to make a triangle: a + b > c and b + c > a and c + a > b
3 is a, 3 is b, 2 is c
a + b > c
3 + 3 > 2
6 > 2 -> <em>TRUE
</em>
b + c > a
3 + 2 > 3
5 > 3 -> <em>TRUE
</em>
c + a > b
2 + 3 > 3
5 > 3 -> <em>TRUE
</em>
OPTION B IS A TRIANGLE
Option C and D are automatically incorrect because Option B is incorrect. But, the same process would go to the end.
Answer: Option B
The correct is going to be “Identify the Choices”.
Hope this helps! :))
Anything greater then one?