Type the correct answer in the box. Use numerals instead of words. If necessary, use / for the fraction bar.

How to calulate what percentage a number is of a larger number

Tju [1.3M]

Answer: you just multiply the big by the percentage. But change the percentage to a decimal. There only two operating when dealing with percentage. Add or subtract. Once you multiply the percentage with big number add or subtract the answers with the big number.

Step-by-step explanation:

8 0

3 years ago

Only one question, correct answer gets brainliest

hodyreva [135]

Answer:

16.3420

Step-by-step explanation:

here is what I got

7 0

2 years ago

Read 2 more answers

Help solve for x. round to the nearest tenth

Llana [10]

Answer:

x = 3.7

Step-by-step explanation:

Apply trigonometric function to find x

Reference angle = 24°

Opposite = x

Hypotenuse = 9

This, apply SOH:

Sin 24 = Opp/Hyp

Sin 24 = x/9

9 × Sin 24 = x

3.66062979 = x

x = 3.7 (nearest tenth)

4 0

2 years ago

Complete the equation so it has infinitely many solutions.

ANEK [815]

Answer:

2)27

Step-by-step explanation:

18+3(3+5x)=15x+____

18+9+15x is still the same as 15x+____

so 27+15x is =15x+27

hope I helped mark as brainliest answer

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