2 years ago

Evaluate. Show all work 51-(21-5)x2

Mathematics

2 answers:

marishachu [46]2 years ago

8 0

Step-by-step explanation:

B bracket

O of

D division

M multiplication

A addition

S subtraction

therefore 51-32 is equal to 49

masya89 [10]2 years ago

5 0

Answer:

Step-by-step explanation:

51-(16)x2

16x2=32

51-32=19

You might be interested in

There are 565 sheets of paper in a book

Kisachek [45]

565 sheets/ 1 book* 2,000 books= 1,130,000 sheets.

The final answer is 1.13*10^(6) sheets.

Hope this helps~

4 0

2 years ago

Amanda was given three numbers: 8,

Firdavs [7]

Answer:

Yeah, She can.

Step-by-step explanation:

Simply using 8/5

5 0

2 years ago

Que es la geometria

viktelen [127]

You need help with geometry ?

8 0

2 years ago

Read 2 more answers

The scheme where you can find the greatest common divisor of two integers by repetitive application of the division algorithm is

HACTEHA [7]

Answer:

False

Step-by-step explanation:

Euclidean Algorithm is the algorithm that allows us to find the greatest common divisor (gcd) of two integers by repetitive application of the division algorithm.

A division algorithm is an algorithm which, given two integers N and D, computes their quotient and/or remainder.

Quotient and/or Remainder = $\frac{N}{D}$

8 0

2 years ago

HELP PLEASEEEEEEEEEEEEEE

sineoko [7]

Answer:

I think it's B 121.5

Step-by-step explanation:

I don't feel like explaining how I got that

6 0

2 years ago