All categories

1 year ago

A circular room has a floor of diameter 590cm. Estimate the 92.2 perimeter of the room in metres

Mathematics

1 answer:

coldgirl [10]1 year ago

8 0

Answer:

18.5 m

Step-by-step explanation:

The diameter in meters is 5.90, so the circumference of the room is ...

C = πd = 5.90π m ≈ 18.5 m

The perimeter of the room is about 18.5 m.

You might be interested in

Tasha has eight more fish than Oscar, who has twice as many fish as Cecilia. If altogether they have 148 fish, how many fish do

Viefleur [7K]

Answer:

They each have 64

Step-by-step explanation:

let C = number of fish that Cecilia has --- then, O = 2C, where O = number of fish that Oscar has --- and T = O + 8 = 2C + 8, where T = number of fish that Tasha has --- then, C + O + T = C + 2C + (2C + 8) = 148 --- or, 5C + 8 = 148 --- or, 5C = 140 --- or, C = 140/5 = 28 --- and, O = 2C = 2(28) = 56 --- and, T = O + 8 = 56 + 8 = 64

7 0

2 years ago

If trapezoid JKLM with vertices) (3, 4), K (6,4), L (8, 1) and M (1,1) is rotated 270 degrees counterclockwise, what are the

Stels [109]

Answer:

$J' = (4,-3)$

Step-by-step explanation:

Given

$J = (3, 4)$

$K =(6,4)$

$L = (8, 1)$

$M = (1,1)$

$Rotation = 270CCW$

Required

Determine the new coordinate of J

From rules of rotation,

When a point (x,y) is rotated 270 degrees CCW;

The new point becomes (y,-x)

Considering point J

$J = (3, 4)$

This means

$(x,y) = (3,4)$

Where $x = 3$ and $y = 4$

Using the above rotation rule of

$(x,y) -> (y,-x)$

The coordinates of J' becomes

$J' = (4,-3)$

7 0

1 year ago

Suppose 1000 people enter a chess tournament. Use a rooted tree model of the tournament to determine how many games must be play

Vlada [557]

Answer: 999 games

Step-by-step explanation:

There are many ways to illustrate the rooted tree model to calculate the number of games that must be played until only one player is left who has not lost.

We could go about this manually. Though this would be somewhat tedious, I have done it and attached it to this answer. Note that when the number of players is odd, an extra game has to be played to ensure that all entrants at that round of the tournament have played at least one game at that round. Note that there is no limit on the number of games a player can play; the only condition is that a player is eliminated once the player loses.

The sum of the figures in the third column is 999.

We could also use the formula for rooted trees to calculate the number of games that would be played.

$i=\frac{l - 1}{m - 1}$

where i is the number of "internal nodes," which represents the number of games played for an "<em>m</em>-ary" tree, which is the number of players involved in each game and l is known as "the number of leaves," in this case, the number of players.

The number of players is 1000 and each game involves 2 players. Therefore, the number of games played, i, is given by

$i=\frac{l - 1}{m - 1} = i=\frac{1000 - 1}{2 - 1} = \frac{999}{1} =999$