On the restricted partition function via determinants with Bernoulli polynomials. II
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2019
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866913334525165568 |
|---|---|
| author | Cimpoeas, Mircea |
| author_facet | Cimpoeas, Mircea |
| contents | Let $r\geq 1$ be an integer, $\mathbf a=(a_1,\ldots,a_r)$ a vector of positive integers and let $D\geq 1$ be a common multiple of $a_1,\ldots,a_r$. In a continuation of a previous paper we prove that, if $D=1$ or $D$ is a prime number, the restricted partition function $p_{\mathbf a}(n): = $ the number of integer solutions $(x_1,\dots,x_r)$ to $\sum_{j=1}^r a_jx_j=n$ with $x_1\geq 0, \ldots, x_r\geq 0$ can be computed by solving a system of linear equations with coefficients which are values of Bernoulli polynomials and Bernoulli Barnes numbers. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1902_00745 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | On the restricted partition function via determinants with Bernoulli polynomials. II Cimpoeas, Mircea Number Theory 11P81, 11B68, 11P82 Let $r\geq 1$ be an integer, $\mathbf a=(a_1,\ldots,a_r)$ a vector of positive integers and let $D\geq 1$ be a common multiple of $a_1,\ldots,a_r$. In a continuation of a previous paper we prove that, if $D=1$ or $D$ is a prime number, the restricted partition function $p_{\mathbf a}(n): = $ the number of integer solutions $(x_1,\dots,x_r)$ to $\sum_{j=1}^r a_jx_j=n$ with $x_1\geq 0, \ldots, x_r\geq 0$ can be computed by solving a system of linear equations with coefficients which are values of Bernoulli polynomials and Bernoulli Barnes numbers. |
| title | On the restricted partition function via determinants with Bernoulli polynomials. II |
| topic | Number Theory 11P81, 11B68, 11P82 |
| url | https://arxiv.org/abs/1902.00745 |