Ask question

Ask question

All categories

2 years ago

9

The following are the ages (years) of 5 people in a room:

1 answer:

Novosadov [1.4K]2 years ago

5 0

Answer:

44

Step-by-step explanation:

mean = (13+15+12+16+14+X)/6 = 19

70+X=19×6

X=114-70=44

You might be interested in

What is 15 = -y + 10

Murrr4er [49]

It's a simple linear equation in a single variable, 'y' . Its solution is the number
that 'y' must be in order to make the equation a true statement. Here's how to
find the solution:

Write the equation: <span>15 = -y + 10

Subtract 10 from each side: 5 = -y

Multiply each side by -1 : <u>-5 = y</u>
</span>

7 0

3 years ago

Read 2 more answers

Can somebody please help me with this question?

Aliun [14]

Answer:

120, 114, 126

Step-by-step explanation:

Since these are all exterior angles, they will all always add up to 360°. Since we know this, you can set up an equation and it would be x+(x+6)+114=360. When added you get 2x+120=360. Now subtract 120 on each side to get 2x equals 240. Then you divide by 2 and get that x is 120. Now all you have to do is plug x into the equations for the angles so they would be 120, 114, and 120+6 so 126. Now you have 120,114,and 126 as your angles. To check, just add all the angle measurements up and it should equal 360.

4 0

3 years ago

Read 2 more answers

Which of the following is a solution of x2 + 5x = −2? (2 points) 5 plus or minus the square root of 33 divided by two. 5 plus or

Delicious77 [7]

The easiest way it to solve it.
${x}^{2} + 5x + 2 = 0$
You have
$\rho = 25 - 4 \times 1 \times 2 = 17$
Thus
$x = \frac{ - 5 \pm \sqrt{17} }{2}$

5 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

3 years ago

John believes that the amount of sleep he gets the night before a test and his score on that test are inversely related. On his

eimsori [14]

Answer:

sometimes it be like that

Step-by-step explanation:

y

e

s

8 0

3 years ago