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
Nikolay [14]
3 years ago
13

The stained glass window below is a semicircle. What is the distance around the window to the nearest hundredth of an inch? Use

3.14 for π.
Mathematics
1 answer:
Brrunno [24]3 years ago
8 0

Answer:

The area of a circle is given by the formula

area=πr2

we have the value of π=3.14 , and the radius is taken from the diameter of the window (bottom edge), using the relation:

r=diameter

2r=362

r=18

By substituting these values to the formula of a circle, we now have:

area= (3.14 )  (18) 2

area=1017.36

But since the window is a semicircle, the area will have to be divided in half, therefore,

area of a semicircle =1017.362

area of a semicircle = 508.68

Thus the window's area is equal to 508.68 sq in.

You might be interested in
What is 4,000,000 + 700,000 + 20,000 + 9,000 + 600 + 60 + 2 in standard form?
Ivanshal [37]

Answer:

4729662

Step-by-step explanation:

5 0
3 years ago
About 18% of the population of a large country is nervous around strangers
sashaice [31]

Answer:

ok

Step-by-step explanation:

4 0
2 years ago
I think it's B but idk
Sergeu [11.5K]
You are correct. The answer is B.) They are congruent because they are corresponding angles.

Nice job! Hope this helped :)
4 0
3 years ago
Read 2 more answers
How do the volumes of cylinders, cones, and spheres relate to each other if they have the same radius and height?
Oxana [17]

Answer:

search it up

Step-by-step explanation:

7 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
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:
  • Solve.<br> x² – 8x - 12 = 36
    15·1 answer
  • 3. On a coordinate grid, the location of a lighthouse is at L, and the location of a buoy is at B. At noon, a ship is at the mid
    6·1 answer
  • A piece of string 8 inches long is cut into two pieces, one of which is of length x inches. If this piece is made into the circu
    7·1 answer
  • For a given input value x, the function f outputs a value y to satisfy the following equation.
    13·1 answer
  • What is the value of y?<br><br> 2x+3x=105<br> x+2y=65
    11·2 answers
  • If Tevin has 2 times as many dimes as nickels and they have a combined value of 100 cents, how many of each coin does he have?
    9·2 answers
  • Help me please<br><br>This is indistinguishable to another one of my posts but not the same
    9·1 answer
  • If h(x) =5 for the function h(x) =2x+1 what is the value of x
    6·2 answers
  • Which graph shows the solution to the inequality -3x-7 ​
    13·1 answer
  • Logic and proof , need help asap
    9·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!