|
Organizers |
A simple proof of a theorem of Agarwal and Balasubramanian
by
Jukka Pihko
University of Helsinki
We denote by d(n) the number of divisors of n. Using n-color partitions, Agarwal and Balasubramanian [1, p. 766] proved an explicit formula for the sum of d(n), for consecutive odd values of n. We give a simple, direct proof of their result.
| Reference |
Date received: December 10, 1998
Copyright © 1998 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cacf-02.