The science fair judges will be science teachers and volunteers. each judge will only have time to view 5 science fair projects. there are 133 science teachers. what is the fewest number of volunteers needed to have enough judges for all of the projects?

The fewest number of volunteers needed to have enough judges for all of the projects is 2.

Step-by-step explanation:

Number of science teachers = 133

Number of science fair projects viewed by each judge = 5

Let the number of judge be n

Since number of volunteers must be multiple of 5 .

According to question,

So, Possibility for number of volunteers must be 2 to make it divisible by 5.

Hence, the fewest number of volunteers needed to have enough judges for all of the projects is 2.

i dont get it. where are the "descriptions"?