Helpppp!!!!!!!!!!!!!!

g100num [7]

Answer:-4,5625 i think

Step-by-step explanation:

4 0

2 years ago

An air force introductory course in electronics uses a personalized system of instruction whereby each student views a videotape

lys-0071 [83]

Answer:

See explaination

Step-by-step explanation:

We can define standard deviation in statistics as a measure of the amount of variation or dispersion of a set of values. A low standard deviation indicates that the values tend to be close to the mean of the set, while a high standard deviation indicates that the values are spread out over a wider range.

See attachment for the step by step solution

8 0

3 years ago

What is the correct definition for tan 0

Reptile [31]

$tan\theta=\frac{sin\theta}{cos\theta}\\\\\\Look\ at\ the\ picture.\\\\In\ a\ right\ triangle:\\\\sin\theta=\frac{a}{c};\ cos\theta=\frac{b}{c};\ tan\theta=\frac{a}{b}\\\\\frac{sin\theta}{cos\theta}=\frac{\frac{a}{c}}{\frac{b}{c}}=\frac{a}{c}\times\frac{c}{b}=\frac{a}{b}=tan\theta$

3 0

3 years ago

Can I please get some help on this...I have tried to many times...

Bezzdna [24]

Answer: A

Step-by-step explanation:

First, the problem is g(f(x)). You would plug in f(x) wherever you see an x in g(x). To find the domain, you take the bottom function, and set it equal to 0.

$\sqrt{x-2} =0$

When you solve that, you get x=2. You know your domain is x≥2, but there is as asymptote at x=11. That means the graph never reaches x=11, but gets very close. You find that by setting the entire equation equal to 0 and solve from there.

5 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