Only one, but it sure takes a shitload of light bulbs!
or
Three:
One to write the light bulb removal program,
one to write the light bulb insertion program, and
one to act as a light bulb administrator to make sure nobody else tries to change the light bulb at the same time.
or
One. He gives it to six Californians, thereby reducing the problem to an earlier joke...
In earlier work, Wiener [1] has shown that one mathematician can change a light bulb.
If k mathematicians can change a light bulb, and if one more simply watches them do it, then k+1 mathematicians will have changed the light bulb.
Therefore, by induction, for all n in the positive integers, n mathematicians can change a light bulb.
Bibliography:
[1] Wiener, Matthew P., <11485@ucbvax>, Re: YALBJ, 1986
or