All categories

2 years ago

17. A bottlenose dolphin jumps out of the water. The path the dolphin Travels can be

Mathematics

1 answer:

Anton [14]2 years ago

4 0

Answer:

a. 5 units

b. 5 units

Step-by-step explanation:

Given:

The path the dolphin Travels can be modelled by $h = -0.2d^2 + 2d$ where h represents the height of the dolphin and d represents horizontal distance.

To find: maximum height that the dolphin reaches and the distance covered by dolphin

Solution:

$h = -0.2d^2 + 2d$

Differentiate with respect to $d$

$\frac{\mathrm{d} h}{\mathrm{d} d}=-0.4d+2$

To find the critical point, put $\frac{\mathrm{d} h}{\mathrm{d} d}=0$

$d=\frac{2}{0.4}\\=\frac{20}{4}\\=5 \,\,units$

Differentiate $\frac{\mathrm{d} h}{\mathrm{d} d}$ again with respect to $d$

$\frac{\mathrm{d^2} h}{\mathrm{d} d^2}=-0.4$

So, $d=5$ is a point of maxima

$h(5) = -0.2(5)^2 + 2(5)\\=-0.2(25)+10\\=-5+10\\=5\,\,units$

a. 5 units

b. 5 units

You might be interested in

In how many ways may one A, three B’s, two C’s, and one F be distributed among seven

astraxan [27]

7 different ways is the answer

5 0

2 years ago

Find the smallest 4 digit number such that when divided by 35, 42 or 63 remainder is always 5

alex41 [277]

The smallest such number is 1055.

We want to find $x$ such that

$\begin{cases}x\equiv5\pmod{35}\\x\equiv5\pmod{42}\\x\equiv5\pmod{63}\end{cases}$

The moduli are not coprime, so we expand the system as follows in preparation for using the Chinese remainder theorem.

$x\equiv5\pmod{35}\implies\begin{cases}x\equiv5\equiv0\pmod5\\x\equiv5\pmod7\end{cases}$

$x\equiv5\pmod{42}\implies\begin{cases}x\equiv5\equiv1\pmod2\\x\equiv5\equiv2\pmod3\\x\equiv5\pmod7\end{cases}$

$x\equiv5\pmod{63}\implies\begin{cases}x\equiv5\equiv2\pmod 3\\x\equiv5\pmod7\end{cases}$

Taking everything together, we end up with the system

$\begin{cases}x\equiv1\pmod2\\x\equiv2\pmod3\\x\equiv0\pmod5\\x\equiv5\pmod7\end{cases}$

Now the moduli are coprime and we can apply the CRT.

We start with

$x=3\cdot5\cdot7+2\cdot5\cdot7+2\cdot3\cdot7+2\cdot3\cdot5$

Then taken modulo 2, 3, 5, and 7, all but the first, second, third, or last (respectively) terms will vanish.

Taken modulo 2, we end up with

$x\equiv3\cdot5\cdot7\equiv105\equiv1\pmod2$

which means the first term is fine and doesn't require adjustment.

Taken modulo 3, we have

$x\equiv2\cdot5\cdot7\equiv70\equiv1\pmod3$

We want a remainder of 2, so we just need to multiply the second term by 2.

Taken modulo 5, we have

$x\equiv2\cdot3\cdot7\equiv42\equiv2\pmod5$

We want a remainder of 0, so we can just multiply this term by 0.

Taken modulo 7, we have

$x\equiv2\cdot3\cdot5\equiv30\equiv2\pmod7$

We want a remainder of 5, so we multiply by the inverse of 2 modulo 7, then by 5. Since $2\cdot4\equiv8\equiv1\pmod7$ , the inverse of 2 is 4.

So, we have to adjust $x$ to

$x=3\cdot5\cdot7+2^2\cdot5\cdot7+0+2^3\cdot3\cdot5^2=845$

and from the CRT we find

$x\equiv845\pmod2\cdot3\cdot5\cdot7\implies x\equiv5\pmod{210}$

so that the general solution $x=210n+5$ for all integers $n$ .

We want a 4 digit solution, so we want

$210n+5\ge1000\implies210n\ge995\implies n\ge\dfrac{995}{210}\approx4.7\implies n=5$

which gives $x=210\cdot5+5=1055$ .

5 0

3 years ago

What is a in the quadratic eqation if the points are (3,-30), (5,0), (7,70), (9,180)

LenaWriter [7]

Very very simple so back in my day when people have been wondering on this app waddling and waddling they think they can do it when they go it is the easiest of the easiest way for me a duck rubber kind intact it is 15

7 0

3 years ago

Where can the perpendicular bisectors of an acute triangle intersect

ololo11 [35]

I think inside the triangle......

4 0

3 years ago

Can somebody help me? Thank you!

lana [24]

Answer:

SSS

Step-by-step explanation:

XW = YZ by reflective the line

XY = WZ by the two lines

and XZ = XZ by reflective property of congruence

5 0

2 years ago

Read 2 more answers