All categories

3 years ago

Arthur had $90. He spent $40 and gave $20 to his brother. What fraction of Arthur’s money is left? Show bar model for answer

Mathematics

1 answer:

pshichka [43]3 years ago

4 0

He has 3/9 of his money left.
Or the better answer of 1/3

Here is the bar model
Sorry that the writing is sloppy. I will explain what it reads if needed T-T

You might be interested in

Find the length UV A 9 units B about 3.0 C 65 units D about 8.1 units

wariber [46]

Answer:

D. I got it right on my quiz.

Step-by-step explanation:

5 0

3 years ago

Math work plz, i just need to get an answer

Neporo4naja [7]

It is 10, and 15 I believe

6 0

3 years ago

Read 2 more answers

A building 190 feet tall casts a 90 foot long shadow. if a person stands at the end of the shadow and looks up to the top of the

Ivahew [28]

Answer:

About 64.65 degrees

Step-by-step explanation:

$\tan(x) = \frac{190}{90}$

$x = { \tan}^{ - 1} \frac{190}{90} = 64.65$

Make sure your calculator is in degree mode.

5 0

2 years ago

Given the speeds of each runner below, determine who runs the fastest.

lbvjy [14]

Answer:

Brooke runs the fastest.

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

3 years ago