Answer:
52
Step-by-step explanation:
If it's a math problem like that just google it hope this helped!
It's a Fibonacci sequence sum of two prior (Xn=Xn-1+Xn-2). X6=X6-1+X6-2
X6=X5+ X4
So the answer is 59.
3, 10, 13, 23, 36, 59…
Answer:
70/5
Step-by-step explanation:
70/3 and then try 70/4 and then 70/5
The equation is
-
= 
Solution
<u>Step 1:</u>
Take square on both sides, we get
3x - 2
-2 = x +2
<u>Step 2:</u>
Subtract 3x - 2 from both sides, we get
-2
<u>Step 3:</u>
Again, square on both sides in order to get rid of the square root from the above equation, we get

Now we have to simplify it,

<u>Step 4:</u>
Now we have to solve this quadratic equation, in order to get the solution.
We get x = 2 and x = -2, When we verifying solution in the original given equation, the solution does not satisfy the equation.
Reason: We get negative number in the square root.
Therefore, it has no Roots.
<em>Answer: b) No roots</em>
Formula for permutation is:

<h3><u>Calculation</u>, </h3>
Plug in the values:
Required number of ways = ²C7





<em>Thus, </em><em>The</em><em> </em><em>players</em><em> </em><em>can</em><em> </em><em>be</em><em> </em><em>selected</em><em> </em><em>in</em><em> </em><em>21</em><em> </em><em>different</em><em> </em><em>ways</em><em>!</em><em>!</em><em>~</em>