An antelope can run at a speed of 61 miles per hour. what is this speed in yards per second? round to nearest hundredths

X2 +8x+16=0 in factoring algorithm

Setler79 [48]

Answer:

(x+4)^2 =0

Step-by-step explanation:

x2 +8x+16=0

What 2 numbers multiply to 16 and add to 8

4*4 = 16

4+4 =8

(x+4) (x+4) =0

(x+4)^2 =0

4 0

2 years ago

What association does the scatter plot show

Verizon [17]

C. No Association
This is because there is no definitive line in the graph or upwards or downwards trend

3 0

2 years ago

Read 2 more answers

A large mixing tank initially contains 1000 gallons of water in which 40 pounds of salt have been dissolved. Another brine solut

sergey [27]

Answer:

If A(t) represents the amount of salt in the tank at time t, the correct differential equation for A is is dA/dt = 15 - 0.005A

Option C) dA/dt = 15 - 0.005A is the correction Answer

Step-by-step explanation:

Given the data in the question;

If A(t) represents the amount of salt in the tank at time t, the correct differential equation for A is?

dA/dt = rate in - rate out

first we determine the rate in and rate out;

rate in = 3pound/gallon × 5gallons/min = 15 pound/min

rate out = A pounds/1000gallons × 5gallons/min = 5Ag/1000pounds/min

= 0.005A pounds/min

so we substitute

dA/dt = rate in - rate out

dA/dt = 15 - 0.005A

Therefore, If A(t) represents the amount of salt in the tank at time t, the correct differential equation for A is is dA/dt = 15 - 0.005A

Option C) dA/dt = 15 - 0.005A is the correction Answer

8 0

2 years ago

In order for you to answer the question correctly, please use the following image down below:

adell [148]

Answer:

36

Step-by-step explanation:

24^2 = (12)(12+x)

576 = 144 + 12x

432 = 12x

36 = x

7 0

2 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