All categories

2 years ago

A condominium building has 25 condo units. Each unit has 5 windows. Ryder said that there are 125 windows altogether.

1 answer:

3 0

The answer is B, 30 x 5 The answer is reasonable. Ryder is correct. It reasonable because if 25 x 5 is 125, then 30 x 5 won't be too much to be unreasonable. 30 x 5 is 150, therefore it is only 25 windows higher, so it is reasonable. Hope this helps! :)

You might be interested in

To divide 572 divide 4, Stanley estimated to place the first digit of the quotient. In which place is the first digit of the quo

andreyandreev [35.5K]

It would go over the five, so im guessing the hundreds

6 0

3 years ago

You are on the 2nd floor, go down 3 floors, and back up 7 floors. On what floor are you on now? *

scZoUnD [109]

Answer:

6th floor

Step-by-step explanation:

2-3+7

-1+7

3 0

2 years ago

Read 2 more answers

What is the answer to 9 m+ 9

klemol [59]

Answer: 18m

Step-by-step explanation:

9m + 9

Simplify:

9+9=18

Hence, the answer to 9m + 9 is 18m.

3 0

2 years ago

The theoretical probability of choosing a red grape from a

miskamm [114]

Answer:36

Step-by-step explanation: if 2 out of 9 or red and there are 8 red that means that divide 8 by to get 4 * 9 + 36

7 0

2 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 (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