How many ounces is 10491 ounces to pounds?

Given the following system, what would be the best way to start slowing the system?

dusya [7]

A would be the correct answer because the y variable only has a coefficient of 1. So we would solve for y, which would get us y=3x+5, then we would substitute the value in the second equation which would look like -4x+5(3x+5)=58. Hope this helpss. :)

6 0

3 years ago

-2 > m/6 - 7 whats The answer?

Verdich [7]

Answer:

m<30

Step by Step:

simplify m over 6

7 0

3 years ago

A King in ancient times agreed to reward the inventor of chess with one grain of wheat on the first of the 64 squares of a chess

statuscvo [17]

Let's start by visualising this concept.

Number of grains on square:
1 2 4 8 16 ...

We can see that it starts to form a geometric sequence, with the common ratio being 2.

For the first question, we simply want the fifteenth term, so we just use the nth term geometric form:
$T_n = ar^{n - 1}$
$T_{15} = 2^{14} = 16384$

Thus, there are 16, 384 grains on the fifteenth square.

The second question begs the same process, only this time, it's a summation. Using our sum to n terms of geometric sequence, we get:
$S_n = \frac{a(r^{n} - 1)}{r - 1}$
$S_{15} = \frac{2^{15} - 1}{2 - 1}$
$S_{15} = 2^{15} - 1 = 32767$

Thus, there are 32, 767 total grains on the first 15 squares, and you should be able to work the rest from here.

6 0

2 years ago

Read 2 more answers

What's the mean of 8, 17, 9, 3, 13

Gnom [1K]

Mean is a form of average, and in order to find this we add up all the numbers then divide by the amount of numbers we have.

So, we have 5 numbers here. (8, 17, 9, 3, and 13)

8 + 17 + 9 + 3 + 13 = 50

50/5 = 10

The mean of those five numbers is 10.

6 0

2 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

2 years ago