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
Flura [38]
2 years ago
11

If u answer ill give brainlist

Mathematics
1 answer:
makkiz [27]2 years ago
3 0

Answer:

120; 643 units squared

Step-by-step explanation:

Perimeter: Add all the sides, so 120 units

_________________________________

Area: First multiply 19 by 24 for the first shape within this other shape, so That equals 456 units squared. Since we know that one whole side is 36 we can subtract 19 from it to get the lower side of the smaller shape and then multiply that by 11. So the smaller side ends up being 17. So 17 times 11 equals: 187 units squared. Then just add the areas together 187+456=643 units squared.

You might be interested in
A storage tank has A circumference Of 200 meters what is the area of the base of the tank
lorasvet [3.4K]

Circumference = 2 pi r

2 pi r = 200

r = 100 / pi

Area of base = pi r r

Area of base = 100*100 / pi

Area of base = 3183.1 sq. m.

6 0
3 years ago
Nathan wants to use coordinate geometry to prove that the opposite sides of a rectangle are congruent. He places parallelogram A
Fynjy0 [20]
The formula used to find the length of a line segment is the same formula as the Pythagoras theorem.

We take CD as the hypotenuse of the right-angled triangle and the distance between the x-coordinates and y-coordinates as the length of two short sides.

We can write the formula as
CD = \sqrt{( x_{1}- x_{0})  ^{2}+ ( y_{1}- y_{0})  ^{2}  }
CD = \sqrt{(a-0)^{2}+ (b-b)^{2}  }

7 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
2 years ago
Can someone help me with the question in the image please. if correct i will mark as brainliest
matrenka [14]

Answer:

I believe it is a=64; b=2 divided by 10 (I'm sorry if it's wrong I hope you pass)

5 0
3 years ago
Read 2 more answers
I need help someone pleassssseeeee
lys-0071 [83]
The answer would be B. 
3 0
3 years ago
Read 2 more answers
Other questions:
  • X+19=13<br><br><br> Find the value of x.
    11·2 answers
  • Subtracting polynomials
    12·1 answer
  • Kendall is buying a home for $119,000. She is making a 12% down payment and financing the rest with a 20-year loan at a 4.5% int
    5·1 answer
  • GIVING CROWN IS RIGHT!!!!!!
    11·1 answer
  • Bob is angry with his friend for eating his sandwich. Which conflict best describes this situation?
    14·2 answers
  • How can this be solved?
    5·2 answers
  • There are 2 children in each row. How many children are in 5 rows?​
    12·2 answers
  • Simplify the expression (-502) square root 0
    6·1 answer
  • Help me asap please!!!!​
    13·1 answer
  • NEED HELP ASAP!!!!
    7·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!