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
Greeley [361]
3 years ago
15

Margaret is planning a rectangle garden. It's length is 4ft less than twice it's width. It's area is 170ft squared. What are the

dimensions of the garden?
Mathematics
1 answer:
Stolb23 [73]3 years ago
7 0
L*W=Area L=2w-4

(2w-4)*w=170

You might be interested in
2.1 in a decimal form
Allisa [31]

2.1 is already in a decimal form.

Hope I helped!

7 0
3 years ago
Can you help me figure out the slope of this line?<br> please and thx<br> ASAP.
KonstantinChe [14]


The rise is the vertical distance between the two points, which is the difference between their y-coordinates. That makes the rise y2 − y1. The run between these two points is the difference in the x-coordinates, or x2 − x1.
8 0
2 years ago
I NEED HELP ASAP!!!!!!!!!!
svetoff [14.1K]

Answer:

I know the answer

Step-by-step explanation:

x = random number then y = x + y then x = 68 So we can conclude

5 0
2 years ago
Equivalent to (6 + y) × 5?
Sergeeva-Olga [200]
The answer is:
It’s equivalent to 30+5y
6 0
2 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
2 years ago
Other questions:
  • Three times a first number decreased by a second number
    5·1 answer
  • The Original Price of a video game is $35 with a discount of 25%. What is the sales price?
    5·1 answer
  • You can get 4 value meals for 21.88 at the restaurant how much is each value meal?
    11·2 answers
  • (2,5) and (3/2 ,2) find the slope of the line passing through the points.
    13·1 answer
  • I really want to know what 87x73 is showing work.
    14·1 answer
  • When we slice a three-dimensional object, we expose new faces that are two dimensional. The two-dimensional face is called _____
    6·1 answer
  • How many edgès does the figure have?
    9·1 answer
  • May you someone help me It's my last question!​
    5·1 answer
  • 1. Solve the compound inequality. You do not need to graph the solution.
    12·1 answer
  • Use a graphing calculator to approximate the vertex of the graph of the parabola defined by the following
    6·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!