There are six professors teaching the introductory discrete mathematics class at a university. The same final exam is given by all six professors. If the lowest possible score on the final is 0 and the highest possible score is 100, how many students must there be to guarantee that there are two students with the same professor who earned the same final examination score

607 students

Step-by-step explanation:

To solve this question means we have to use Pigenhole principle which states that if y number of items are put into z number of containers, with y > z, then it means that that at least one container must definitely contain more than one item.

Now, let's find the number of boxes and objects:

If possible scores are from 0 to 100 with both inclusive it means number of possible scores = 101.

Now, If there was only one professor grading the students, in order to ensure that that there are two students with the same professor who earned the same final examination score,

The number of students would have to be = 101 + 1 = 102 students

Meanwhile, for each student, since there are 6 professors, the possible combination for a score will be = 6 possible combinations.

Therefore, number of students that will guarantee that there are two students with the same professor who earned the same final examination score must be a minimum of: (6 × 101) + 1 = 607

check the picture below.

well, the angle at the vertex d is clearly not a right-angle, let's check for the one at the vertex f which does look like,   however if it's indeed, that means ef is perpendicular to df, in which case their slopes will be negative reciprocal of each other.

so the negative reciprocal of the slope of ef is 1, however the slope of df is not 1, is 1/2, so nope, they're not perpendicular lines.

the answer is b.

step-by-step explanation:

identity property is where 0+whatever number=whatever number. basically 0+ a number.