How many subsets of 5 e elements can be made from a set of 7 elements?

seems like this.

Step-by-step explanation:

From set theory, the factorial combinations are 2^N where N are the number of induvidual mambers of the set and that includes the null set. If we require that one element be the minimum to form a set, this eliminates the empty set (and there is only one empty set) so we must subtract one from the formula. The correct answer is therefore 2^N-1. In this case that is 2^5–1 = 31.

answer: slight chance that it will happen

step-by-step explanation:

- "runner b is moving at a slower rate."

- "the graphs shown are graphs of distance(km) against time(min).

the slopes of this graphs are are given by:

slope = (change in y)/(change in x)

= (change in distance)/(change in time)

this is the formula for finding the speed. so, the slope of these graphs represent the speed of the runner.

taking each division in the graph to represent 1 on both axis:

runner a ⇒ speed = (2-0)/(1-0)

= 2/1

= 2 km/min

runner b ⇒ speed = (3-0)/(3-0)

= 3/3

= 1 km/min

this shows that   runner b is moving at a slower rate."