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
7nadin3 [17]
3 years ago
5

What is the rule for the reflection

Mathematics
1 answer:
hram777 [196]3 years ago
3 0

Step-by-step explanation:

We reflect We triangle across both axis so the x and y values will both switch.

Our triangle is originally in the second quadrant but then go to the 4the after we reflect it.

Second Quadrant are

^;8+1—](

You might be interested in
Hayley is filling a tank with water. She measures the depth, in inches, of the water in the tank at the end of each hour for 8 h
weeeeeb [17]

Answer:

the top left

Step-by-step explanation:

7 0
3 years ago
The area of these shapes are?
kipiarov [429]
Answer:
Figure 1:
Area = 390ft^2

Figure 2:
Area = 325.17 ft^2
7 0
3 years ago
Which one of the following statements is true?
dangina [55]

Answer:

C= to find x, add the given angles

Step-by-step explanation:

5 0
2 years ago
a proportional relationship is represented on a graph with a line that had a slope of 65. what is the unit rate of the relations
erik [133]

Answer:

65

Step-by-step explanation:

8 0
3 years ago
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
N76 [4]

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

3 0
3 years ago
Other questions:
  • A kitchen makes 2,944 ounces of soup each week. There are 128 ounces in 1 gallon. How many gallons of soup does the kitchen make
    12·1 answer
  • Simplify -4 1/6 - -6 1/3 Which of the following is correct?
    8·1 answer
  • A new bank customer with $4,500 wants to open a money market account. The bank is offering a
    10·2 answers
  • Sloane kicked a soccer ball at a speed of 36 feet per second. If the ball never leaves the ground, then it can be represented by
    13·1 answer
  • What’s the answer <br> For this picture problem
    9·1 answer
  • What is 4 divided by 520
    12·1 answer
  • Helpppp meeeee pleaseee
    12·1 answer
  • I need help with:
    6·1 answer
  • Find the equation for the line that passes through ( - 4,9) that has slope 5/7
    6·1 answer
  • Please help quick:
    5·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!