This paper develops expressions for the exact number of solutions to the well known Knapsack problem. These formulae are compared with the bounds given by other researchers in this problem. A computer programme has also been developed to find the number of solutions.