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
If one side has one, the other side has to get one. Once launched, they cannot be recalled. When they land, they screw up everything forever.
or
Six. One to turn the bulb, one for support, and four to relate to the experience.
or