All categories

3 years ago

2(3x-5)Explain how to write it.

Mathematics

1 answer:

wolverine [178]3 years ago

5 0

Hello!

I'm assuming we're simplifying here

to simplify, use the distributive property of multiplication

2 * 3x = 6x

2 * (-5) = -10

6x - 10 is your simplified answer

I hope this helps, and have a nice day!

You might be interested in

D) Pedro spends some of his money and at the end of the two

Ksenya-84 [330]

Answer:

it depend

Step-by-step explanation:

hopefully i help

5 0

2 years ago

What is the area of the following shape? Do not put units.

____ [38]

Answer:

Area = 30

Step-by-step explanation:

Add the two sides

8 + 4 = 12

Multiply that number by the height

12 × 5 = 60

Divide that number by 2

60 ÷ 2 = 30

4 0

2 years ago

Ali has x cards.

valentina_108 [34]

━━━━━━━━━━━━━━━ ♡ ━━━━━━━━━━━━━━━

If Ali has x cards, then Belinda has 2x cards.

If Ali has x cards, then Charlie has x+5 cards.

2x (Belinda) + x+5 (Charlie) + x (Ali) = 33 (total)

2x + x+5 + x = 33

Now simplify the equation... x+x+5 can be simplified as 2x+5.

2x+5 plus 2x can become 4x+5.

So their total number is 4x+5.

So 4x+5=33.

You want to isolate the variables and numbers.

To remove the 5 from the left side, subtract 5 from both sides.

4x+5-5=4x - 33-5=28

So the equation now is 4x=28

To remove the 4, divide each side by 4.

4x÷4=x - 28÷4=7

So x equals 7, Ali has 7 cards.

━━━━━━━━━━━━━━━ ♡ ━━━━━━━━━━━━━━━

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 (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

How do you use the order of operations to evaluate expressions with exponents?

IgorLugansk [536]

Using BEDMAS, it would be brackets first, so anything Inside a set of brackets would be solved first, and would follow the same rule. Once the brackets have been solved, next would be the exponents. Since your brackets have been solved you can expand with the exponents. After exponents, would be anything that has to be divided or multiplied. These two operations are interchangeable based on what is more convenient or beneficial to do first. And lastly, addition and subtraction, which once again are interchangeable operations

5 0

2 years ago