Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Charles A. Nicol
PNAS 1953;39;963-968
doi:10.1073/pnas.39.9.963
This information is current as of March 2007.
Notes:
VOL. 39, 1953 MA THEMA TICS: C. A. NICOL 963
E(n) = U(n) except when n = 22 k(3k + 1), when E(n) - U(n) = (-1)k
The case where we have only a finite number of terms in (2) has received
comparatively little attention. If in (1) we let z = 1 we have
n-1
F,,- (1, x) = II (1 - Xe). (3)
s=1
The coefficient of xk for k < n will be E(k) - U(k). But the coefficient of
xk for k > n is the number of partitions of k into an even number of unequal
parts, none of which is larger than n, minus the number of partitions of k
964 MA THEMA TICS: C. A. NICOL PROC. N. A. S.
into an odd number of unequal parts, none of which is larger than n. This
then is an extension of the analogous problem arising in the use of the in-
finite product.
Also if z is replaced by -1 we consider the following function.
n-i
(-) n-lFn-_ (-I xX) = I(1 + x8). (4)
s-i
The coefficient of x" resulting from the expansion of this product is the
number of partitions of k as a sum of distinct positive integers none of
which is larger than n. This may also be stated as the number of solutions
of the equation x1 + 2x2 + ... + (n - l)x-i= k, where for i = 1, 2, ...,
(n - 1), xi is either zero or unity.
The products (3) and (4) have been studied by Cauchy, T. Vahlen, von
Sterneck, and others.2 In particular von Sterneck studied the case where
the polynomial resulting from the expansion is reduced modulo a positive
integer.
Fundamental in this investigation will be the use of the number3
v
c1(k, n) = (n)
(p(n/(k, n))_A(n/(k, n)), (5)
where k and n are positive integers and (k, n) denotes the greatest common
divisor of k and n. If n is a positive integer so(n) denotes as usual the
number of positive integers less than n and prime to it. (s(1) = 1.)
Also, for n a positive integer, p(n) is zero if n contains a repeated prime
factor. Otherwise u2(n) is equal to (-I)T where Y is the number of dis-
tinct prime factors of n. (,u(1)-1.) Note that (5) reduces to ,A(n) when
(k, n) = 1 and p(n) when (k, n) n. Although (5) appears more compli-
cated than its constituents it will be shown that many of the principal
theorems concerning it are hardly more complex than those involving the
(p or IA number alone.
The properties of the coefficients in the development of (1) are extensively
used to obtain properties of (5) and vice versa.
We now state a number of theorems without proof. We hope to publish
the proofs elsewhere.
In the following paragraphs the symbol [x] will denote the largest integer
contained in the real number x. Also the symbol $(a, b) will denote the
number defined in (5) where a and b are positive integers.
We have if k, r, and n are positive integers that4
FE,
(r,n) - 1
exp (2rirk/n) = c1(k, n), (6)
where the range of r is over all positive integers less than n and prime to
it. (j2 = -1.)
VOL. 39, 1953 MA THEMA TICS: C. A. NICOL 965
d O otherwise.
din
Similarly
(0 if (k, n) $ n.
>Z(_ l)d D(k, n/d) = (-n if (k, n) = n, n even. (8)
din (Oif (k,n) = n,n odd.
We may also prove
THEOREM 2. Let a.(k) denote the sum of the divisors of k less than or equal
to n. Then,
n
,
s=1
[n/s]P(k, s) = oan(k). (9)
In case k = 1 this becomes the well-known relation"
n
E [n/s]A(s) = 1.
Also if k is replaced by n! we have another known result6
n
E [n/s] sp(s)
s=l
= n(n + 1)/2.
THEOREM 3. If 5 n, then
where
Rs(d) = (d
9 ) (_1)a
and this sum is over all integral solutions at of the equation (nld) a +, = s
whereO < s< n, 0 . a <d, 0 < . < n/d.
966 MA THEMA TICS: C. A. NICOL PROC. N. A. S.
Consider now the function F,n-(z, x) defined in (1). If n > 1 and the
product is expanded as a polynomial in x, we may write
n
FP-1(z, x) = s=O
E P,(z)x8, (12)
where ni = n(n - 1)/2 and P.(z) is a polynomial in z. Then we may define
the polynomial B,(z) as
Mg
Bj(z) E
= k=O Pkn+t(Z), (13)
where n, = [(n - 1)/2 - t/n] and 1 < t < n.
Then we may obtain
THEOREM 5. If z is a number different from unity, then
E Aox, where nj
s-O
= n(n - 1)/2. -(15)
Also define the number C, by the relation
Mc
C:=E
k=O
Ak*+:, where n, = [(n - 1)/2 -t/n]. (15a)
Then we obtain the following
THEOREM 6.
Ct = n(t,n), (16)
where C, is defined in (15a).
THEOREM 7.
in
io(n) =- E C2, (17)
n t=l
where Cs is defined in (15a).
In view of theorem 6 we may write theorem 7 as
lin
sp(n) = - Ej 12 (t, n). (18)
n t=i
An observation of possible interest may be made concerning theorem
7 if it is noted that C, (o(n). Then (17) becomes a quadratic relation in
(p(n). Employing the quadratic formula we find
VOL. 39, 1953 MA THEMA TICS: C. A. NICOL 967
4(t, n) =
2 f {Fn_- (exp(i6)) E exp(-(kn + t)iO)} dO, (20)
n-I
where Fn_i(exp(iO)) = I (1 - exp(siO)) andlnf = [(n - 1)/2 - t/n].
$=1
Similarly for the numbers Ag defined in (15) we have
1 (2w
At =
Jr 1Fn-l (exp(iO)) (exp(-tiO))) dO. (21)
Furthermore the numbers A, defined in (15) have the following proper-
ties:
n
s=O
jA1A > n, (22)
where ni = n (n - 1)/2.
A rather unusual property of these numbers is:
THEOREM 9. If di (n - 1), then
A = 0, (23)
(s, n-1) =d