Answer:
11.4166667
Step-by-step explanation:
Answer:
did you try 12÷ by the decimal form of 3/4
namely, how many times does 3/4 go into 3½? Let's firstly convert the mixed fraction to improper fraction.
![\bf \stackrel{mixed}{3\frac{1}{2}}\implies \cfrac{3\cdot 2+1}{2}\implies \stackrel{improper}{\cfrac{7}{2}} \\\\[-0.35em] ~\dotfill\\\\ \cfrac{7}{2}\div \cfrac{3}{4}\implies \cfrac{7}{~~\begin{matrix} 2 \\[-0.7em]\cline{1-1}\\[-5pt]\end{matrix}~~}\cdot \cfrac{\stackrel{2}{~~\begin{matrix} 4 \\[-0.7em]\cline{1-1}\\[-5pt]\end{matrix}~~}}{3}\implies \cfrac{14}{3}\implies 4\frac{2}{3}](https://tex.z-dn.net/?f=%5Cbf%20%5Cstackrel%7Bmixed%7D%7B3%5Cfrac%7B1%7D%7B2%7D%7D%5Cimplies%20%5Ccfrac%7B3%5Ccdot%202%2B1%7D%7B2%7D%5Cimplies%20%5Cstackrel%7Bimproper%7D%7B%5Ccfrac%7B7%7D%7B2%7D%7D%20%5C%5C%5C%5C%5B-0.35em%5D%20~%5Cdotfill%5C%5C%5C%5C%20%5Ccfrac%7B7%7D%7B2%7D%5Cdiv%20%5Ccfrac%7B3%7D%7B4%7D%5Cimplies%20%5Ccfrac%7B7%7D%7B~~%5Cbegin%7Bmatrix%7D%202%20%5C%5C%5B-0.7em%5D%5Ccline%7B1-1%7D%5C%5C%5B-5pt%5D%5Cend%7Bmatrix%7D~~%7D%5Ccdot%20%5Ccfrac%7B%5Cstackrel%7B2%7D%7B~~%5Cbegin%7Bmatrix%7D%204%20%5C%5C%5B-0.7em%5D%5Ccline%7B1-1%7D%5C%5C%5B-5pt%5D%5Cend%7Bmatrix%7D~~%7D%7D%7B3%7D%5Cimplies%20%5Ccfrac%7B14%7D%7B3%7D%5Cimplies%204%5Cfrac%7B2%7D%7B3%7D)
The "midpoint formula" is the same as the "average formula:"
x-coordinate of the midpoint = average of -2 and 10:
= (-2 + 10) / 2 = 4
y-coordinate of the midpoint = average of 3 and 3:
= (3+3) / 2 = 3
Thus, the midpoint of the given line segment is (4,3).
The true statement about why the Fibonacci sequence is recursively defined is (c) The Fibonacci sequence is recursively-defined because you must know the values of the two previous terms in order to find the value of the next term
<h3>How to determine the true statement</h3>
With an exception to the first two terms, each term of the Fibonacci sequence is the sum of the two previous terms
This means that,
The Fibonacci sequence cannot be defined explicitly, because the two previous terms can not be determined by a direct formula
Hence, the true statement about why the Fibonacci sequence is recursively defined is (c)
Read more about the Fibonacci sequence at:
brainly.com/question/16934596
