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
ozzi
2 years ago
9

The volume of Pyramid A is 704 cm3 and the volume of Pyramid B is 297 cm3. If the pyramids are similar and the surface area of P

yramid B is 153 cm2, what is the the surface area of Pyramid A?
Mathematics
1 answer:
SIZIF [17.4K]2 years ago
4 0

Answer:

272 cm²

Step-by-step explanation:

Step 1

We have to find the scale factor

When given the volume of two solids, the formula for the scale factor is

V1/V2 = (Scale factor)³

The volume of Pyramid A is 704 cm³ and the volume of Pyramid B is 297 cm³

V1 = Pyramid A

V2 = Pyramid B

704/297 = (scale factor)³

We simplify the left hand side to simplest fraction

The greatest common factor of 704 and 297 = 11

704÷11/297÷11 = (scale factor)³

64/27 = (scale factor)³

We cube root both sides

cube root(scale factor)³ = cube root (64/27)

scale factor = (4/3)

Step 2

(Scale factor)² = S1/S2

S1 = Surface area of Pyramid A =?

S2 = Surface area of Pyramid B = 153 cm²

Hence,

(4/3)² = S1/153

16/9 = S1/153

Cross Multiply

S1 × 9 = 16 × 153

S1 = 16 × 153/9

S1 = 272 cm²

Therefore, the Surface Area of Pyramid A = 272 cm²

You might be interested in
West of Checkpoint A, which is at (0,5), are two hurdles that Helena needs to jump over. Hurdle 1 is 4 units west of Checkpoint
jeka94

Answer:

Coordinate of Checkpoint B is (-9,5)

Step-by-step explanation:

Here is an inserted image of the graph and coordinates.

6 0
2 years ago
If a industrial machine made 678 shirts if you make 3 shirts in one minute how many minutes are you working
Aleks04 [339]
You simply divide 678 by 3 and get 226.
7 0
3 years ago
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
2 years ago
Use the rules to evaluate or simplify. Write without negative exponents.
zhannawk [14.2K]
(y^-5) / (y^-2)
Flip fraction and get rid of the negative from the exponents (you can do that!)
(y^2) / (y^5)
(y * y) / (y * y * y * y * y)
Cancel y's
1 / (y * y * y)
1 / (y^3)

That's your answer.
Have an awesome day! :)
7 0
3 years ago
How do I condense each expression?
Ksivusya [100]

Answer:

  \log_5{\dfrac{x^5}{\sqrt[4]{8-x}}}

Step-by-step explanation:

Make use of the rules of logarithms:

  log(a/b) = log(a) - log(b)

  log(a^b) = b·log(a)

__

  5\log_5{x}-\dfrac{1}{4}\log_5{(8-x)}=\log_5{x^5}-\log_5{\sqrt[4]{8-x}}=\log_5{\dfrac{x^5}{\sqrt[4]{8-x}}}

5 0
3 years ago
Other questions:
  • Find r(x + 1) if r(x) = x3 + x + 1
    14·2 answers
  • What is 4.76 hours converted to min and sec
    10·2 answers
  • OKAY I NEED THIS DONE ASAP,LIKE NOW...PLEASE???? Thanks :3
    13·1 answer
  • PLEEASSE HELP:))) (theres a pic)
    10·1 answer
  • In 2000 fries were $2.00 in 2015 they were $4.50 what is the percent changes in the e cost
    5·1 answer
  • Lee watches TV for 2 hours per day. During that time, the TV consumes 150 watts per hour. Electricity costs (12 cents)/(1 kilowa
    6·1 answer
  • 12. What type of sequence is this? *
    15·2 answers
  • Can i get some help with this question please <br><br>​
    12·2 answers
  • Please help guys Describe constant rate of change.
    11·2 answers
  • PLEASE ANSWER ILL GIVE YOU BRIANLIEST
    10·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!