On the asymmetric divisor problem with congruence conditions
Manfred Kühleitner
Abstract
Open-access reader
Manfred Kühleitner
Abstract
Open-access reader
summary:A certain generalized divisor function $d^*(n)$ is studied which counts the number of factorizations of a natural number $n$ into integer powers with prescribed exponents under certain congruence restrictions. An $\Omega$-estimate is established for the remainder term in the asymptotic for its Dirichlet summatory function.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
summary:A certain generalized divisor function $d^*(n)$ is studied which counts the number of factorizations of a natural number $n$ into integer powers with prescribed exponents under certain congruence restrictions. An $\Omega$-estimate is established for the remainder term in the asymptotic for its Dirichlet summatory function.
Key concepts: Congruence (geometry), Mathematics, Divisor (algebraic geometry), Computer science, Combinatorics, Geometry