Elementary Evaluation of Convolution Sums involving primitive Dirichlet Characters for a Class of positive Integers
Abstract
We extend the results obtained by E. Ntienjem to all positive integers. Let be the subset of consisting of , where is in and is a squarefree finite product of distinct odd primes. We discuss the evaluation of the convolution sum, , when is in . The evaluation of convolution sums belonging to this class is achieved by applying modular forms and primitive Dirichlet characters. In addition, we revisit the evaluation of the convolution sums for , , , , . If , we determine natural numbers and use the evaluated convolution sums together with other known convolution sums to carry out the number of representations of by the octonary quadratic forms . Similarly, if , we compute natural numbers and make use of the evaluated convolution sums together with other known convolution sums to determine the number of representations of by the octonary quadratic forms . We illustrate our method with the explicit examples , , and , .
Keywords
Cite
@article{arxiv.1609.01343,
title = {Elementary Evaluation of Convolution Sums involving primitive Dirichlet Characters for a Class of positive Integers},
author = {Ebénézer Ntienjem},
journal= {arXiv preprint arXiv:1609.01343},
year = {2016}
}
Comments
30 pages, 2 figures, 8 tables. arXiv admin note: text overlap with arXiv:1607.01082