1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
ohaa [14]
2 years ago
8

In the expression (21 – 3) X (7 + 2) = (12 - 4), what operation should you perform last? Why?

Mathematics
2 answers:
meriva2 years ago
5 0

Answer:

Substraction

Step-by-step explanation:

(21-3)x(7+2)=(12-4)

1. 18 x 9 = 12-4

2. 162-8 = 8-8

3. 162-8 = 154

lys-0071 [83]2 years ago
4 0

Answer:

The solution is False because there is no solution to the equation

Step-by-step explanation:

(21-3)×(7+12)= (12-4)

First, remove the brackets

18×19=8

Then, Multiply

342=8

SOLUTION is False

You might be interested in
What is the side length of a square with the area of 20cm2
rodikova [14]

Answer:

S = a² => 20 = a² => a = √20 ≈ 4.5 cm

Step-by-step explanation:

5 0
3 years ago
Will give BRAINLIEST!!!! Answer fast!!! If a + b + c =−2 and x + y = 10, what is -9a + 2x - 9b - 9c + 2y?
riadik2000 [5.3K]
A^5b^3 is your answer

 
5 0
3 years ago
True or false all points in quadrant 2 has a negative (x) value
ladessa [460]

Answer:

False, quadrant two has both negative and positive values.  

Hope I helped. Good luck on the assignment!

Step-by-step explanation:


4 0
3 years ago
Pleaseeeee answer I will mark brainliest for best answer ^>^
Orlov [11]
Answer: 7.6

Explanation:
8 0
3 years ago
Read 2 more answers
There are eight different jobs in a printer queue. Each job has a distinct tag which is a string of three upper case letters. Th
Vikentia [17]

Answer:

a. 40320 ways

b. 10080 ways

c. 25200 ways

d. 10080 ways

e. 10080 ways

Step-by-step explanation:

There are 8 different jobs in a printer queue.

a. They can be arranged in the queue in 8! ways.

No. of ways to arrange the 8 jobs = 8!

                                                        = 8*7*6*5*4*3*2*1

No. of ways to arrange the 8 jobs = 40320 ways

b. USU comes immediately before CDP. This means that these two jobs must be one after the other. They can be arranged in 2! ways. Consider both of them as one unit. The remaining 6 together with both these jobs can be arranged in 7! ways. So,

No. of ways to arrange the 8 jobs if USU comes immediately before CDP

= 2! * 7!

= 2*1 * 7*6*5*4*3*2*1

= 10080 ways

c. First consider a gap of 1 space between the two jobs USU and CDP. One case can be that USU comes at the first place and CDP at the third place. The remaining 6 jobs can be arranged in 6! ways. Another case can be when USU comes at the second place and CDP at the fourth. This will go on until CDP is at the last place. So, we will have 5 such cases.

The no. of ways USU and CDP can be arranged with a gap of one space is:

6! * 6 = 4320

Then, with a gap of two spaces, USU can come at the first place and CDP at the fourth.  This will go on until CDP is at the last place and USU at the sixth. So there will be 5 cases. No. of ways the rest of the jobs can be arranged is 6! and the total no. of ways in which USU and CDP can be arranged with a space of two is: 5 * 6! = 3600

Then, with a gap of three spaces, USU will come at the first place and CDP at the fifth. We will have four such cases until CDP comes last. So, total no of ways to arrange the jobs with USU and CDP three spaces apart = 4 * 6!

Then, with a gap of four spaces, USU will come at the first place and CDP at the sixth. We will have three such cases until CDP comes last. So, total no of ways to arrange the jobs with USU and CDP three spaces apart = 3 * 6!

Then, with a gap of five spaces, USU will come at the first place and CDP at the seventh. We will have two such cases until CDP comes last. So, total no of ways to arrange the jobs with USU and CDP three spaces apart = 2 * 6!

Finally, with a gap of 6 spaces, USU at first place and CDP at the last, we can arrange the rest of the jobs in 6! ways.

So, total no. of different ways to arrange the jobs such that USU comes before CDP = 10080 + 6*6! + 5*6! + 4*6! + 3*6! + 2*6! + 1*6!

                    = 10080 + 4320 + 3600 + 2880 + 2160 + 1440 + 720

                    = 25200 ways

d. If QKJ comes last then, the remaining 7 jobs can be arranged in 7! ways. Similarly, if LPW comes last, the remaining 7 jobs can be arranged in 7! ways. so, total no. of different ways in which the eight jobs can be arranged is 7! + 7! = 10080 ways

e. If QKJ comes last then, the remaining 7 jobs can be arranged in 7! ways in the queue. Similarly, if QKJ comes second-to-last then also the jobs can be arranged in the queue in 7! ways. So, total no. of ways to arrange the jobs in the queue is 7! + 7! = 10080 ways

5 0
3 years ago
Other questions:
  • Pls hurry I’ll give brainist Maria heard on the radio that the high temperature that day would be 64°F. To determine the tempera
    5·1 answer
  • The area of a rectangle is 440 square inches. The length of the rectangle is 29 inches more than its width. What is the length o
    7·1 answer
  • Wht is the expression and Jose’s final score?
    10·1 answer
  • Help por favor!! please
    7·1 answer
  • Find f(3) given that f(3) = -x^4 + 3x^3 + x^2 - 8x - 16.
    8·1 answer
  • What's the volume of the prism ​
    6·2 answers
  • Find the equation of a line that contains the points (6, -7) and (8,5). Write the equation in slope-intercept form.
    7·1 answer
  • Someone plz help me
    14·1 answer
  • Find the equations of the line that:
    15·1 answer
  • The table contains data for six students in a running club: time run in minutes, x, and the corresponding average speed in mph,
    15·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!