1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
alexdok [17]
3 years ago
11

A water storage tank is in the shape of a hemisphere​ (half a​ sphere). If the radius is 20 ​ft, approximate the volume of the t

ank in cubic feet.
Mathematics
1 answer:
otez555 [7]3 years ago
7 0

Answer:

The approximate volume of the tank is V=16,747\ ft^{3}

Step-by-step explanation:

we know that

The volume of a hemisphere (water storage tank) is equal to

V=\frac{4}{6}\pi r^{3}

we have

r=20\ ft

assume

\pi =3.14

substitute

V=\frac{4}{6}(3.14)(20)^{3}

V=16,747\ ft^{3}

You might be interested in
Question in image! Thanks for help! (Also im posting more questions like this so if these are easy for you keep a eye out on my
AlexFokin [52]

Answer:

c. x=50; m< LOK = 114

Step-by-step explanation:

(x+64) + 66 = 180

x + 130 = 180

x = 50

4 0
3 years ago
Read 2 more answers
Gollum eats fish on alternate days.How often doea he eat fish on a Monday?
VikaD [51]
He eats fish every other Monday
4 0
3 years ago
Read 2 more answers
5. The recursive algorithm given below can be used to compute gcd(a, b) where a and b are non-negative integer, not both zero.
s2008m [1.1K]

Implementating the given algorithm in python 3, the greatest common divisors of <em>(</em><em>124</em><em> </em><em>and</em><em> </em><em>244</em><em>)</em><em> </em>and <em>(</em><em>4424</em><em> </em><em>and</em><em> </em><em>2111</em><em>)</em><em> </em>are 4 and 1 respectively.

The program implementation is given below and the output of the sample run is attached.

def gcd(a, b):

<em>#initialize</em><em> </em><em>a</em><em> </em><em>function</em><em> </em><em>named</em><em> </em><em>gcd</em><em> </em><em>which</em><em> </em><em>takes</em><em> </em><em>in</em><em> </em><em>two</em><em> </em><em>parameters</em><em> </em>

if a>b:

<em>#checks</em><em> </em><em>if</em><em> </em><em>a</em><em> </em><em>is</em><em> </em><em>greater</em><em> </em><em>than</em><em> </em><em>b</em>

return gcd (b, a)

<em>#if</em><em> </em><em>true</em><em> </em><em>interchange</em><em> </em><em>the</em><em> </em><em>Parameters</em><em> </em><em>and</em><em> </em><em>Recall</em><em> </em><em>the</em><em> </em><em>function</em><em> </em>

elif a == 0:

return b

elif a == 1:

return 1

elif((a%2 == 0)and(b%2==0)):

<em>#even</em><em> </em><em>numbers</em><em> </em><em>leave</em><em> </em><em>no</em><em> </em><em>remainder</em><em> </em><em>when</em><em> </em><em>divided</em><em> </em><em>by</em><em> </em><em>2</em><em>,</em><em> </em><em>checks</em><em> </em><em>if</em><em> </em><em>a</em><em> </em><em>and</em><em> </em><em>b</em><em> </em><em>are</em><em> </em><em>even</em><em> </em>

return 2 * gcd(a/2, b/2)

elif((a%2 !=0) and (b%2==0)):

<em>#checks</em><em> </em><em>if</em><em> </em><em>a</em><em> </em><em>is</em><em> </em><em>odd</em><em> </em><em>and</em><em> </em><em>B</em><em> </em><em>is</em><em> </em><em>even</em><em> </em>

return gcd(a, b/2)

else :

return gcd(a, b-a)

<em>#since</em><em> </em><em>it's</em><em> </em><em>a</em><em> </em><em>recursive</em><em> </em><em>function</em><em>,</em><em> </em><em>it</em><em> </em><em>recalls</em><em> </em><em>the function</em><em> </em><em>with </em><em>new</em><em> </em><em>parameters</em><em> </em><em>until</em><em> </em><em>a</em><em> </em><em>certain</em><em> </em><em>condition</em><em> </em><em>is</em><em> </em><em>satisfied</em><em> </em>

print(gcd(124, 244))

print()

<em>#leaves</em><em> </em><em>a</em><em> </em><em>space</em><em> </em><em>after</em><em> </em><em>the</em><em> </em><em>first</em><em> </em><em>output</em><em> </em>

print(gcd(4424, 2111))

Learn more :brainly.com/question/25506437

6 0
3 years ago
How many endpoints are needed to draw four line segments
Paladinen [302]
If these four line segments are connected (kind of like a square) then only 4 endpoints are needed, but if they are all separate line segments, then you would need a maximum of 8 endpoints because any line segment has 2 endpoints and 4 line segments with 2 endpoints a piece equals 8 endpoints in total. 

I hope this helped! :)
5 0
3 years ago
You ask a neighbor to water a sickly plant while you are on vacation. Without water the plant will die with probability 0.75. Wi
Dafna1 [17]

Answer:

0.2915

Step-by-step explanation:

Let W represent water and D represent Dying probability

W = water

D = die

 

->If with water, it will die with probability 0.4

P(W & D) = 0.82 x 0.4 = 0.328

->Without water the plant will die with probability 0.75

P(W ' & D) = 0.18 x 0.75 = 0.135

Taking sum of the above values with water and without water.

P(D) = P(W & D) +  P(W ' & D) = 0.4643

P(W ' | D) = P(W ' & D) / P(D)

= 0.135 /0.463

= 0.2915 ≈ 29.15%

Thus, the probability the neighbor forgot to water is 0.2915

4 0
3 years ago
Other questions:
  • An angle bisector of a triangle divides the opposite side of the triangle into segments 6 cm and 5 cm long. A second side of the
    10·1 answer
  • 24=7/8g I need help with this equation and explain how to do it please?
    12·1 answer
  • Write the interval (5, 100] as an inequality and using set notation
    9·1 answer
  • 1. What is the simplified form of the expression?
    14·1 answer
  • 2 miles in 10560 minutes. how many feet are in 3 miles
    6·2 answers
  • Identify the x-intercepts of the function below f(x)=x^2+12x+24
    11·1 answer
  • The perimeter of a square is equal to the perimeter of an equilateral triangle. The length of a side of the square is given by x
    10·1 answer
  • Evaluate the expression, 12w - 5 if w = 4*<br> (2 Points)<br> Enter your answer
    12·1 answer
  • Find the value of x in the polygon <br>​
    10·2 answers
  • (4) Which of the following is a true statement about the Distance Formula?
    7·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!