Ask question

Ask question

All categories

3 years ago

5

Four students draw a design for a class flag. Each flag is black and white. Which designs have the same fractions of black and w

hite? Explain how you know.

1 answer:

Orlov [11]3 years ago

3 0

Where is the picture

You might be interested in

Need some help with these 2 math questions, They are related so best to finish one then work on the bisect. Thank you.

ElenaW [278]

Answer:

iyfohvvlcoyyfpuufpupfyofgogpugulglgulgug

4 0

2 years ago

Read 2 more answers

The shampoo Eva likes to use costs $6 for a 24-ounce bottle. The conditioner she likes to use costs $12 for a 30-ounce bottle. H

lutik1710 [3]

Answer:

0.15

Step-by-step explanation:

6 divided by 24 equals 0.25

12 divided by 30 equals 0.4

0.4 minus 0.25 is 0.15

8 0

3 years ago

chelsea takes the bus to school,but she walks home. the bus travels to the school at an average speed of 45 miles per hour. whil

jekas [21]

For this case, the first thing you should know is:
d: v * t
Where,
d: distance
v: speed
t: time
To go to school by bus we have:
d = 45 * t
To return from school we have:
d = 2.5 * (1-t)
how the distance is the same:45 * t = 2.5 * (1-t)
Answer:
the equation that will help find the time it takes chelsea to get to school on the bus is:
45 * t = 2.5 * (1-t)
Note: the equation will have one solution.

4 0

3 years ago

lord [1]

Answer:

Dilate from center A by scale factor of 2, then reflect over line AC

Step-by-step explanation:

6 0

2 years ago

If a computer network has 60 switching nodes, in how many ways can 2 or 3 nodes fail?___________

notka56 [123]

Answer:

There are 35990 ways in which 2 or 3 nodes fail

Step-by-step explanation:

Given : A computer network has 60 switching nodes.

To Find : In how many ways can 2 or 3 nodes fail?

Solution:

We are supposed to find no. of ways can 2 or 3 nodes fail.

So, we will use combination here .

No. of ways can 2 or 3 nodes fail= $^{60}{C_2 +^{60}C_3$

Formula : $^nC_r =\frac{n!}{r!(n-r)!}$

No. of ways can 2 or 3 nodes fail= $\frac{60!}{2!(60-2)!}+\frac{60!}{3!(60-3)!}$

= $35990$

Hence there are 35990 ways in which 2 or 3 nodes fail

5 0

3 years ago