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
Aleksandr [31]
3 years ago
12

W=2xyz solve for y how would you go about this problem?

Mathematics
2 answers:
satela [25.4K]3 years ago
8 0
Divide 2xz in each side W/2xz=2xyz/2xz W/2xz=y
Readme [11.4K]3 years ago
7 0
I would start by dividing w to x y z seperately

You might be interested in
Solve the problem for Part A and Part B
Novosadov [1.4K]

Part A answer is (A)

Part B answer is 3.170

5 0
3 years ago
(7/4x-5)+(2y-3.5)+(-1/4x+5)
Mazyrski [523]
Hope this helps you !

6 0
3 years ago
What is the height of the wall that is 30 feet long and that required 2310 bricks to build
Diano4ka-milaya [45]
(2310)=7(30)H
2310=210H

<span>11=H

I hope this helps!
</span>
7 0
3 years ago
In a sample of digits(0,1,2,3,4,5,6,7,8,9,) what is the probability that a digit is 7 or greater
ad-work [718]

Answer:

\frac{3}{10}

Step-by-step explanation:

There are 10 numbers in total. Only three are 7 or greater: 7, 8, 9.

So the answer is \frac{3}{10}.

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 movie theatre offers popcorn in two different containers for the same price. One container is a rectangular prism with a base
    8·1 answer
  • A 0.40 kg bird is flying at a constant speed of 8.0 m/s. What is the bird's kinetic energy?
    10·2 answers
  • 3 men and 5 women are in a room. A person is chosen at random to give a
    12·2 answers
  • What is the relationship between mass and energy?
    6·1 answer
  • The given line segment has a midpoint at (3, 1).
    9·1 answer
  • Pls help me ‍♀️‍♀️‍♀️
    9·2 answers
  • Solve the equation on the interval [0,2pi] 5sec(x)+7=-3
    9·2 answers
  • Riley wants to make 100ml of 25% saline but only has access to 12% and 38% saline mixtures. x= 12% y=38%
    6·1 answer
  • What is the value of x?<br><br> I’LL MARK BRAINLIEST
    13·2 answers
  • Damon and Peter, who can paddle a canoe at 4 mi/hr in still water, took 8 hr to paddle 9 mi upstream and then return. What was t
    10·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!