All categories

3 years ago

Please can someone answer the question on the attachment ‼️

Mathematics

1 answer:

Lena [83]3 years ago

4 0

Answer: C

Step-by-step explanation: brainliest

You might be interested in

How does the Pythagorean Table help you with addition?

scZoUnD [109]

Answer:

The Pythagorean Theorem is useful for two-dimensional navigation. You can use it and two lengths to find the shortest distance. … The distances north and west will be the two legs of the triangle, and the shortest line connecting them will be the diagonal. The same principles can be used for air navigation.

Step-by-step explanation:

Internet

7 0

3 years ago

There are 43 pine trees currently in the park. Park workers will plant more pine trees

Luden [163]

Answer:

20 pine trees

Step-by-step explanation:

No of pine trees today = 63

No of pine trees there = 43

So no of pine trees planted today= 63-43= 20

8 0

3 years ago

What is a gradient of a line

Dennis_Churaev [7]

(slope) The higher the gradient<span> of a graph at a point, the steeper the </span>line<span> is at that point.</span>

4 0

4 years ago

Read 2 more answers

y′′ −y = 0, x0 = 0 Seek power series solutions of the given differential equation about the given point x 0; find the recurrence

sukhopar [10]

Let

$\displaystyle y(x) = \sum_{n=0}^\infty a_nx^n = a_0 + a_1x + a_2x^2 + \cdots$

Differentiating twice gives

$\displaystyle y'(x) = \sum_{n=1}^\infty na_nx^{n-1} = \sum_{n=0}^\infty (n+1) a_{n+1} x^n = a_1 + 2a_2x + 3a_3x^2 + \cdots$

$\displaystyle y''(x) = \sum_{n=2}^\infty n (n-1) a_nx^{n-2} = \sum_{n=0}^\infty (n+2) (n+1) a_{n+2} x^n$

When x = 0, we observe that y(0) = a₀ and y'(0) = a₁ can act as initial conditions.

Substitute these into the given differential equation:

$\displaystyle \sum_{n=0}^\infty (n+2)(n+1) a_{n+2} x^n - \sum_{n=0}^\infty a_nx^n = 0$

$\displaystyle \sum_{n=0}^\infty \bigg((n+2)(n+1) a_{n+2} - a_n\bigg) x^n = 0$

Then the coefficients in the power series solution are governed by the recurrence relation,

$\begin{cases}a_0 = y(0) \\ a_1 = y'(0) \\\\ a_{n+2} = \dfrac{a_n}{(n+2)(n+1)} & \text{for }n\ge0\end{cases}$

Since the n-th coefficient depends on the (n - 2)-th coefficient, we split n into two cases.

• If n is even, then n = 2k for some integer k ≥ 0. Then

$k=0 \implies n=0 \implies a_0 = a_0$

$k=1 \implies n=2 \implies a_2 = \dfrac{a_0}{2\cdot1}$

$k=2 \implies n=4 \implies a_4 = \dfrac{a_2}{4\cdot3} = \dfrac{a_0}{4\cdot3\cdot2\cdot1}$

$k=3 \implies n=6 \implies a_6 = \dfrac{a_4}{6\cdot5} = \dfrac{a_0}{6\cdot5\cdot4\cdot3\cdot2\cdot1}$

It should be easy enough to see that

$a_{n=2k} = \dfrac{a_0}{(2k)!}$

• If n is odd, then n = 2k + 1 for some k ≥ 0. Then

$k = 0 \implies n=1 \implies a_1 = a_1$

$k = 1 \implies n=3 \implies a_3 = \dfrac{a_1}{3\cdot2}$

$k = 2 \implies n=5 \implies a_5 = \dfrac{a_3}{5\cdot4} = \dfrac{a_1}{5\cdot4\cdot3\cdot2}$

$k=3 \implies n=7 \implies a_7=\dfrac{a_5}{7\cdot6} = \dfrac{a_1}{7\cdot6\cdot5\cdot4\cdot3\cdot2}$

so that

$a_{n=2k+1} = \dfrac{a_1}{(2k+1)!}$

So, the overall series solution is

$\displaystyle y(x) = \sum_{n=0}^\infty a_nx^n = \sum_{k=0}^\infty \left(a_{2k}x^{2k} + a_{2k+1}x^{2k+1}\right)$

$\boxed{\displaystyle y(x) = a_0 \sum_{k=0}^\infty \frac{x^{2k}}{(2k)!} + a_1 \sum_{k=0}^\infty \frac{x^{2k+1}}{(2k+1)!}}$

4 0

3 years ago

F(x) = 2x2 - 4x?; Find (-4)

anastassius [24]

Answer:

0 (zero)

Step-by-step explanation:

Plug in the variable for -4 and solve

y= 2(-4)2-4(-4)

y= -8(2)-4(-4)

y=-16+16

y=0

4 0

3 years ago