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
Svet_ta [14]
3 years ago
8

I need the answer to this question ASAP please help me out. Thank You.

Mathematics
1 answer:
White raven [17]3 years ago
3 0

Answer:

71º

I would give an explanation, but it sound like you could use this answer sooner than later.


You might be interested in
50 POINTS PLZ HELP
Brums [2.3K]

Answer:

Move it to 2 place to the right

Step-by-step explanation:

4.003×100

=400.3

It can be observed that the dot in front of 4 has been shifted in two times to the front giving us 400.3

But in the case of division,it will be two places to the left...

I hope you understand

3 0
3 years ago
Read 2 more answers
I need help desperitly
topjm [15]
Number one is 12. There is 12 cubes.
8 0
3 years ago
PLEASE HELP !! ILL GIVE BRAINLIEST !
fomenos

Answer:

20 + 0i

Step-by-step explanation:

(10 + 5i) + (10 - 5i) = 20 + 0i

7 0
3 years ago
Will crown brainiest for the correct answer<br> plz read and answer<br> try ur best and good luck
eduard

Answer:

53%

Step-by-step explanation:

5 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
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:
  • The net of square pyramid is shown below. What is the surface area of the pyramid?
    11·2 answers
  • In a class, 6 students are girls who wear glasses. 14 students wear glasses. If there are 16 girls in the class, how many boys w
    14·2 answers
  • How does the graph of mc016-1.jpg compare to the graph of the parent square root function?The graph is a horizontal shift of the
    9·1 answer
  • In Sarah‘s dance class 1/16 of the girls are also on the soccer team. what is the decimal form of this fraction
    11·1 answer
  • Simplify:<br> (h2)5<br> A) h-3 <br> B) h3 <br> C) h7 <br> D) h10
    15·2 answers
  • Cost to store: $45 markup: 35% what would be the selling price?
    11·1 answer
  • At Franklin High School, 15% of students play basketball and 4% play baseball and basketball. What is the probablity that a stud
    5·2 answers
  • Which algebraic expression represents the phrase “two times the quantity of a number minus 12”?
    6·1 answer
  • BRAINLIEST plus 30 points IF NO LINKS!<br> PLZ HELP!
    11·2 answers
  • Please help, would be grateful :)
    11·2 answers
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!