Answer: 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,
[tex]5n=135+\text{number of volunteers}\\\\\text{ where, n is a natural number and number of volunteer must be integer}[/tex]
So, Possibility for number of volunteers must be 2 to make it divisible by 5.
[tex]5n=133+2\\\\5n=135\\\\n=\frac{135}{5}\\\\n=27[/tex]
Hence, the fewest number of volunteers needed to have enough judges for all of the projects is 2.
