Professor Hemraj has given a proof of a part of a theorem of Gauss without using the theory of quadratic residues. Proceeding on similar lines, I have obtained a complete proof which is rather simpler and certainly more concise.

Let the set b1b2, b3, …., bk; of k non-negative integers be denoted by Bk. Let ξ;Bk denote the set ξb1 ξb2, ξb3, …. ξbk; ξ being any integer > 1. Without loss of generality, we can suppose that b ≦bi+1.

In his recent paper on partitions (1), Jakub Intrator proved that the number p(n, k) of partitions of n into exactly k summands, 1 < k ≦ n, is given by a polynomial of degree exactly k − 1 in n, the first [(k+1)/2] coefficients of which (starting with the coefficient of the highest degree term), are independent of n and the rest depend on the residue of n modulo the least common multiple of the integers 1, 2, 3, …, k. He even showed (ignoring the case k = 3) that the [(k+3)/2]-th coefficient in the polynomial depends only on the parity of n and is not the same for n even and n odd.

Denoting the sum of the products of the first n natural numbers taken r at a time by the symbol G(n, r), I have shown that

with the initial values and

In general it was shown that

Defining G (x, r) by the fundamental relation:

for all values of x, we get

Let C(n) be the number of partitions of n such that all even multiplicities of the parts are less than 2m, m>1; and all odd multiplicities are at least (2r+1) and at most 2(m+r)—1, r≥0. Let D(n) be the number of partitions ofn into parts which are either odd multiples of (2r+1) or are even and not divisible by 2m.

1. Let g(n) = g(n; m) denote the number of partitions of a natural number n into powers of a given natural number m (> 2). Then the generating function of g(n) is

(1) where we take g(0) = 1.

In a recent paper, R. F. Churchhouse has studied the function b(n) giving the number of partitions of n into powers of 2. The generating function of b(n) is

so that

Using this relation, Churchhouse has shown that

and

where

with

Moreover

and b(n) is even for n ≥ 2, while b(2n) ≡ (mod 4), for n = 22m−l(2k + 1); and, it is not ≡ (mod 8) for any n. He has conjectured that for k ≥ 1 and n odd,

and

The object of this note is to prove these conjectures.

§ 1. Chowla has generalised Wolstenholme's Theorem as follows:

where p denotes as usual a prime, and < is used for “less than and prime to.”