  Let p(n, k) denote the number of partitions of n into parts less than or
equal to k. We show several properties of this function modulo 2. First, we
prove that for fixed positive integers k and m, p(n,k) is periodic modulo m.
Using this, we are able to find lower and upper bounds for the number of odd
values of the function for a fixed k.
