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
Brilliant_brown [7]
2 years ago
8

Volume of Spheres

Mathematics
1 answer:
Oliga [24]2 years ago
6 0
It’s simple. The volume of a sphere is V=4/3πr^3.. so you will convert the mm to m okay?? 10mm=1cm .. so do your conversion from here then when you get the radius then you will substitute it into the volume where r is the radius.. so for the first one l changed mm to cm so.. radius is 4cm then l substitute it into the formula so l got 270 after rounding it to the nearest tenth.. pi=22/7 bear in mind. So do the same for the other one
You might be interested in
Brainliest if correct
natali 33 [55]

\left(15^{1/5} \right)^5  = 15^{(5/5)} = 15^1 = 15

6 0
2 years ago
Hello<br> I have to write at least 20 words to say hi.
maksim [4K]
Hi

I have to write at least 20 words to say hello.
7 0
2 years ago
What is −14 − (+6) =
zepelin [54]

Answer:

-20

Step-by-step explanation:

it basically -14-6

3 0
3 years ago
6 13 multiply by 2 and then add 1
algol13

Answer:

1227 is correct ................................................

Step-by-step explanation:

6 0
2 years ago
Read 2 more answers
uppose that we have a function with a constant amount of work done in initialization, a call to a log-linearsorting algorithm, a
White raven [17]

Answer:

The running time is quadratic (O(n²) )

Step-by-step explanation:

For the set up, we have a constant running time of C. The, a log-linearsorting is called, thus, its execution time, denoted by T(n),  is O(n*log(n)). Then, we call n times a linear iteration, with a running time of an+b, for certain constants a and b, thus, the running time of the algorithm is

C + T(n) + n*(a*n+b) = an²+bn + T + C

Since T(n) is O(n*log(n)) and n² is asymptotically bigger than n*log(n), then the running time of the algorith is quadratic, therefore, it is O(n²).

7 0
2 years ago
Other questions:
  • Elaina wrote two correct variable expressions to represent the phrase “one-fourth of a number.” Which variable expressions could
    13·2 answers
  • If x2 +8x-4=x2+8, then 2x-3+?
    11·1 answer
  • Please help me brainliest for the best answer
    6·1 answer
  • twelve boys collected 16 aluminum cans each. fifteen girls collected 14 aluminum cans each. how many more cans did the girls col
    13·1 answer
  • Write an equation for an ellipse centered at the origin, which has foci at (\pm8,0)(±8,0)left parenthesis, plus minus, 8, comma,
    15·1 answer
  • Select the correct answer.
    10·1 answer
  • Please help me out please
    5·1 answer
  • A. 2miles<br> B.200 miles<br> C.6 miles <br> Please help
    5·1 answer
  • What is the simplest from of this expression? (-3x^2 + 4x) + (2x^2 - x -11)
    13·1 answer
  • 1. Which statement is not true? A. Rational numbers are closed under division. B. Odd numbers are closed under multiplication. C
    10·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!