All categories

3 years ago

Hi someone please help me I'm not sure how to do thissss

Mathematics

1 answer:

Otrada [13]3 years ago

6 0

Answer: (√10)*a

Step-by-step explanation:

In a triangle rectangle, we have 3 sides, in this case, the shorter base, a, the longer base, b and the hypotenuse h.

And the hypotenuse can be found with the Pythagorean's theorem.

a^2 + b^2 = h^2

now, we know that b = 3a, then we can replace it in the above equation:

a^2 + (3*a)^2 = h^2

a^2 + 9*a^2 = h^2

10*a^2 = h^2

now we can apply the square root to both sides and get:

√(10*a^2) = √h^2

(√10)*a = h

Then we have found the length of the hypotenuse in terms of the shorter side a.

You might be interested in

How do you write 4 out of 20 into a decimal

dsp73

.20 or 20. one of those i cant give you the answer because how are u going to learn

8 0

3 years ago

Find the scale factor A. 3.5 B. 3/5 C. 35

Serhud [2]

Answer:

3.5

Step-by-step explanation:

35/10 = 3.5

4 0

3 years ago

What to do if -/7 appears in a math problem

Brrunno [24]

-/7? imagine that there is an -1 as the numerator. so now -/7 turns into -1/7

5 0

3 years ago

What is the name of the shape of the graph of a quadratic function?

dimaraw [331]

Is this a multiple choice or no

6 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 (124 and 244) and (4424 and 2111) are 4 and 1 respectively.

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

def gcd(a, b):

#initialize a function named gcd which takes in two parameters

if a>b:

#checks if a is greater than b

return gcd (b, a)

#if true interchange the Parameters and Recall the function

elif a == 0:

return b

elif a == 1:

return 1

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

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

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

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

#checks if a is odd and B is even

return gcd(a, b/2)

else :

return gcd(a, b-a)

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

print(gcd(124, 244))

print()

#leaves a space after the first output

print(gcd(4424, 2111))

Learn more :brainly.com/question/25506437

6 0

2 years ago