How much should my refund be if i will receive 90% of 200 back?

Which of th following is a solid bounded by the set of all points at a given distance from a given point ?

aleksandrvk [35]

C.Sphere is your answer it is bound to all it's points

4 0

3 years ago

Somebody help me plz with this question?

bonufazy [111]

Answer:

typing this answer to get points hope u get ur answer soon :)

Step-by-step explanation:

3 0

2 years ago

Read 2 more answers

What is 93 divided by 7

igomit [66]

7 goes into 9, that's 1.
Remaining 2.

Move the 2 close to 3, you have 23.

7 into the 23, that's 3 times. 3 times 7 is 21.
So you are left with 2.

The answer is 13 remainder 2.

13\2\7

5 0

3 years ago

Read 2 more answers

Solve the system x-z=5, 2x+y= 7, y+3z=12

Wewaii [24]

x,z,y = 20,15,-33

i think thats it im sorry

7 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

3 years ago