Jeremiah will share his collection with his friends so that they each receive the same number of cards. What is the greatest number of they will each receive

their is no graph showing

step-by-step explanation:

∡ eia and ∡ kij are congruent

step-by-step explanation:

0 and 5 minutes

step-by-step explanation:

given that one morning eight buses arrive late by the number of minutes given below:

0 8 2 6 9 2 0 7 8

write these in ascending order

0   0 2 6 7 8 8 9

in the afternoon two more buses arrive at the bus stop say by x and y minutes late.

total number of buses = 10

median = average of 4th and 5th after arranging in ascending order

since 4th entry is 6, the values of x and y should be below 6

also given 0 is the mode so either x or y or both should be 0 because then only 0 gets the maximum frequency and hence mode

thus we have

0 0 0 2 6 7 8 8 9 and another unknown entry which is below 6.

since median is 3.5, we have the unknown entry to be 5 only because then only median =( 2+5)/2

thus the after noon buses were late by 0 and 5 minutes.

there is only one way to arrange all the eight relative to each other because they are not distinct. we have

now there are nine places to place an (and not more than one in one place).   because we have four symbols, we need to choose four of these nine places to insert an . order does not matter because the are not distinct.

thus there are 1 · c(9,4) ways, or, if we calculate it,

thus there are 126 ways to form such "words."