1996Czech digital mathematics libraryOpen access

On the asymmetric divisor problem with congruence conditions

Manfred Kühleitner

Open full text 0 citations

Abstract

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.

Open-access reader

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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

Related papers

Back to paper searchBrowse research topicsOriginal source
On the asymmetric divisor problem with congruence conditions — Research Paper | ScholarLens