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
Ksivusya [100]
3 years ago
11

If i had 19 hours of work to do in 6 days and had to slpit it up. How many minutes a day would i have to do each day in 6 days?

Mathematics
1 answer:
anastassius [24]3 years ago
5 0

Answer:

19/6 = 3 and 1/6, so you have 3 hours and 10 minutes a day or 190 minutes

You might be interested in
I don't know this can someone help me?
Gemiola [76]

Answer:

513.247

Step-by-step explanation:

6 0
3 years ago
Read 2 more answers
Find the indicated real nth roots of a for n=3 ,a=8
Svetach [21]

Answer:

8^ (1/3) =2

Step-by-step explanation:

We want to find cube root of 8

8^ (1/3)

What number times itself 3 times is 8

2*2*2 =8

8^ (1/3) =2

6 0
3 years ago
Please help me :(((((
notsponge [240]

question 3: -2

question 4: 0

Ordered pairs in a graph go in the sequence of (x, y)

6 0
2 years ago
A square sandbox has an area of 75 square feet. Estimate the length of one of the sides of the sandbo
harkovskaia [24]

not understanding what you are saying?

6 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:
  • Abox contains cards that are numbered from 1 to 100. What is the probability of randomly selecting a number
    12·2 answers
  • Have this done correctly for brainliest​
    13·2 answers
  • If f(x) = –x3, g(x) = 3x2 – 1, and h(x) = 2x + 5, what is the degree of [f o g o h](x)?
    12·2 answers
  • How do you do this question?
    10·1 answer
  • A catering service offers
    6·1 answer
  • The area is ___ square units.
    14·2 answers
  • Whats 100+1? that is just a problem for u guys heheh lol
    14·2 answers
  • Jenna borrowed $5,000 for 3 years and had to pay $1,350 simple interest at the end of that time. What RATE of interest did she p
    11·1 answer
  • The expression 5 1/2x + 6 represents the perimeter of
    12·2 answers
  • On last week's quiz, Andre got 18 questions correct and 2 questions incorrect. What was Andre's score
    8·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!