Let p(n) denote the number of ways in which n can be written as a sum of positive integers. (order of the summands being irrelevant). prove that p(5k+4)≡0 (mod 5) where k is any positive integer.
-
UP 0 DOWN 0 0 1
1 Answers
341As far as I know this was a result discovered by Ramanujan and I dont know of an elementary proof.
