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
8_murik_8 [283]
3 years ago
9

How can you write 2,000 in a exponent

Mathematics
1 answer:
Mnenie [13.5K]3 years ago
3 0
1,000 = 10^3            (3 because there are 3 digits after the first one)

2,000 = 2 * 10^3
You might be interested in
Someone please help...​
Rom4ik [11]

Answer:

y=mc

Step-by-step explanation:

4 0
3 years ago
What is the GCF of 55 and 24
KIM [24]

Answer:

1 is the GCF of 55 and 24

6 0
3 years ago
Given the first term and the common difference find the first five terms and the explicit formula
Zielflug [23.3K]

Answer:

a_{1} = -34,\: a_{2} = -44,\: a_{3} = -54,\: a_{4} = -64,\: a_{5} = -74

____________________________________

a_{n} = -34\:–\:10(n-1)

8 0
3 years ago
How do you write 4/5 in decimal form(Money form)
Oliga [24]
.80 cent if you wright it in percent its 80%
4 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:
  • 14.
    7·1 answer
  • How can i get the number 4 using 6 number 3's?
    8·1 answer
  • Which of the following would be the best first step when solving the following system using the substitution method?
    13·1 answer
  • Which expression should be used to estimate the answer to this story problem? A bag contained 338 beads. Three children shared t
    6·2 answers
  • Please help me out guys
    9·2 answers
  • # hw The cost of a tent rental is $160 for 5 days. At this rate, how much does it cost to rent the tent for one day? Plz answer
    12·1 answer
  • An angle measures 45 Degree . What is the measure of its complement?
    10·2 answers
  • Y=1/3x+2 Is this a linear equation or nonlinear
    14·2 answers
  • The table below represents a linear function f(x) and the equation represents a function g(x):
    11·1 answer
  • for positive acute angles A and B, it is known that cos A=20/29 and sin B=60/61. Find the value of sin(A+B) in simplest form.
    13·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!