Answer:
13 is the answer ok I know but cheating in exam is bad
Step-by-step explanation:
The Taylor series expansion is:
Tₙ(x) = ∑ f⁽ⁿ⁾(a) (x − a)ⁿ / n!
f(x) = 1/x, a = 4, and n = 3.
First, find the derivatives.
f⁽⁰⁾(4) = 1/4
f⁽¹⁾(4) = -1/(4)² = -1/16
f⁽²⁾(4) = 2/(4)³ = 1/32
f⁽³⁾(4) = -6/(4)⁴ = -3/128
Therefore:
T₃(x) = 1/4 (x − 4)⁰ / 0! − 1/16 (x − 4)¹ / 1! + 1/32 (x − 4)² / 2! − 3/128 (x − 4)³ / 3!
T₃(x) = 1/4 − 1/16 (x − 4) + 1/64 (x − 4)² − 1/256 (x − 4)³
f(x) = 1/x has a vertical asymptote at x=0 and a horizontal asymptote at y=0. So we can eliminate the top left option. That leaves the other three options, where f(x) is the blue line.
Now we have to determine which green line is T₃(x). The simplest way is to notice that f(x) and T₃(x) intersect at x=4 (which makes sense, since T₃(x) is the Taylor series centered at x=4).
The bottom right graph is the only correct option.
Answer: 24.8
Explanation: If Henry is halving a number, that means he's dividing it by 2, getting two halves. You would get the original number by undoing that division, or multiplying the product by 2.
2 x 12.4 = 24.8
Problem A
Usually the number of bits in a byte is 8 or 16 or 32 and recently 64. You don't have to write a formula to restrict it to this number of bits. You are not asked to do so. The general formula is 2^n - 1 for the problem of Millie and her golden keys. Somehow the system can be made to choose the right number of bits. Apple IIe s for example, used 8 bits and there was a location that told the processor that fact.
2^n - 1 <<<<< Answer
Problem B
In this case n = 4
2^n - 1 = 2^4 - 1 = 16 - 1 = 15
Millie can collect 15 keys <<<<<< Answer
68
I hope you understand this
