ID: 1806.00651

Some Properties and Applications of Non-trivial Divisor Functions

June 2, 2018

View on ArXiv
S. L. Hill, M. N. Huxley, M. C. Lettington, K. M. Schmidt
Mathematics
Number Theory

The $j$th divisor function $d_j$, which counts the ordered factorisations of a positive integer into $j$ positive integer factors, is a very well-known arithmetic function; in particular, $d_2(n)$ gives the number of divisors of $n$. However, the $j$th non-trivial divisor function $c_j$, which counts the ordered proper factorisations of a positive integer into $j$ factors, each of which is greater than or equal to 2, is rather less well-studied. We also consider associated divisor functions $c_j^{(r)}$, whose definition is motivated by the sum-over divisors recurrence for $d_j$. After reviewing properties of $d_j$, we study analogous properties of $c_j$ and $c_j^{(r)}$, specifically regarding their Dirichlet series and generating functions, as well as representations in terms of binomial coefficient sums and hypergeometric series. We also express their ratios as binomial coefficient sums and hypergeometric series, and find explicit Dirichlet series and Euler products in some cases. As an illustrative application of the non-trivial and associated divisor functions, we show how they can be used to count principal reversible square matrices of the type considered by Ollerenshaw and Br\'ee, and hence sum-and-distance systems of integers.

Similar papers 1

Divisor Functions and the Number of Sum Systems

October 6, 2019

90% Match
Matthew C. Cardiff Lettington, Karl Michael Cardiff Schmidt
Number Theory

Divisor functions have attracted the attention of number theorists from Dirichlet to the present day. Here we consider associated divisor functions $c_j^{(r)}(n)$ which for non-negative integers $j, r$ count the number of ways of representing $n$ as an ordered product of $j+r$ factors, of which the first $j$ must be non-trivial, and their natural extension to negative integers $r.$ We give recurrence properties and explicit formulae for these novel arithmetic functions. Speci...

Find SimilarView on arXiv

Continued Fractions and $q$-Series Generating Functions for the Generalized Sum-of-Divisors Functions

April 18, 2017

86% Match
Maxie D. Schmidt
Number Theory

We construct new continued fraction expansions of Jacobi-type J-fractions in $z$ whose power series expansions generate the ratio of the $q$-Pochhamer symbols, $(a; q)_n / (b; q)_n$, for all integers $n \geq 0$ and where $a,b,q \in \mathbb{C}$ are non-zero and defined such that $|q| < 1$ and $|b/a| < |z| < 1$. If we set the parameters $(a, b) := (q, q^2)$ in these generalized series expansions, then we have a corresponding J-fraction enumerating the sequence of terms $(1-q) /...

Find SimilarView on arXiv

Factorization Theorems for Relatively Prime Divisor Sums, GCD Sums and Generalized Ramanujan Sums

October 19, 2018

85% Match
Hamed Mousavi, Maxie D. Schmidt
Number Theory

We generalize recent matrix-based factorization theorems for Lambert series generating functions generating the coefficients $(f \ast 1)(n)$ for some arithmetic function $f$. Our new factorization theorems provide analogs to these established expansions generating sums of the form $\sum_{d: (d,n)=1} f(d)$ (type I) and the Anderson-Apostol sums $\sum_{d|(m,n)} f(d) g(n/d)$ (type II) for any arithmetic functions $f$ and $g$. Our treatment of the type II sums includes a matrix-b...

Find SimilarView on arXiv

Combinatorial Sums and Identities Involving Generalized Sum-of-Divisors Functions with Bounded Divisors

April 19, 2017

84% Match
Maxie D. Schmidt
Number Theory

The class of Lambert series generating functions (LGFs) denoted by $L_{\alpha}(q)$ formally enumerate the generalized sum-of-divisors functions, $\sigma_{\alpha}(n) = \sum_{d|n} d^{\alpha}$, for all integers $n \geq 1$ and fixed real-valued parameters $\alpha \geq 0$. We prove new formulas expanding the higher-order derivatives of these LGFs. The results we obtain are combined to express new identities expanding the generalized sum-of-divisors functions. These new identities ...

Find SimilarView on arXiv

On A Divisor Sum Involving Pairwise Relatively Prime Positive Integers

September 15, 2019

84% Match
Masum Billal
General Mathematics

The number of tuples with positive integers pairwise relatively prime to each other with product at most $n$ is considered. A generalization of $\mu^{2}$ where $\mu$ is the M\"{o}bius function is used to formulate this divisor sum and establish some identities. One such identity is a weighted sum of reciprocal of square-free numbers not exceeding $n$. Some auxiliary number theoretic functions are introduced to formulate this sum.

Find SimilarView on arXiv

Counting number of factorizations of a natural number

November 21, 2008

83% Match
Shamik Ghosh
Discrete Mathematics
Number Theory

In this note we describe a new method of counting the number of unordered factorizations of a natural number by means of a generating function and a recurrence relation arising from it, which improves an earlier result in this direction.

Find SimilarView on arXiv

Survey of Dirichlet Series of Multiplicative Arithmetic Functions

June 20, 2011

83% Match
Richard J. Mathar
Number Theory

The manuscript reviews Dirichlet Series of important multiplicative arithmetic functions. The aim is to represent these as products and ratios of Riemann zeta-functions, or, if that concise format is not found, to provide the leading factors of the infinite product over zeta-functions. If rooted at the Dirichlet series for powers, for sums-of-divisors and for Euler's totient, the inheritance of multiplicativity through Dirichlet convolution or ordinary multiplication of pairs...

Find SimilarView on arXiv

Exact Formulas for the Generalized Sum-of-Divisors Functions

May 9, 2017

83% Match
Maxie D. Schmidt
Number Theory

We prove new exact formulas for the generalized sum-of-divisors functions, $\sigma_{\alpha}(x) := \sum_{d|x} d^{\alpha}$. The formulas for $\sigma_{\alpha}(x)$ when $\alpha \in \mathbb{C}$ is fixed and $x \geq 1$ involves a finite sum over all of the prime factors $n \leq x$ and terms involving the $r$-order harmonic number sequences and the Ramanujan sums $c_d(x)$. The generalized harmonic number sequences correspond to the partial sums of the Riemann zeta function when $r >...

Find SimilarView on arXiv

Rapidly Convergent Series of the Divisors Functions

July 28, 2014

83% Match
N. A. Carella
General Mathematics

This note gives a few rapidly convergent series representations of the sums of divisors functions. These series have various applications such as exact evaluations of some power series, computing estimates and proving the existence results of some special values of the sums of divisors functions.

Find SimilarView on arXiv

An Explicit Formula For The Divisor Function

May 16, 2014

83% Match
N. A. Carella
General Mathematics

The details for the construction of an explicit formula for the divisors function d(n) = #{d | n} are formalized in this article. This formula facilitates a unified approach to the investigation of the error terms of the divisor problem and circle problem.

Find SimilarView on arXiv