We use the explicit formula of V. Shevelev for the best possible exponent α(m) in the error term of the asymptotic formula of A.O. Gelfond on the number of positive integers nless-than-or-equals, slantx in a given residue class modulo m and a given parity of the sum of its binary digits, to obtain new results about its behaviour.5 page(s
ABSTRACT: For any positive integer n, let a{n) and b{n) denote the inferior and superior k-th power ...
We derive a lower bound for the arithmetic function M(n) = max {|a - b| : a, b ? ? n and ab ? 1 (mod...
We show that the exponent of distribution of the ternary divisor function $d_{3}$ in arithmetic prog...
AbstractWe use the explicit formula of V. Shevelev for the best possible exponent α(m) in the error ...
La présente thèse a été fortement influencée par deux conjectures, l'une de Gelfond et l'autre de Sa...
An important aspect of Diophantine Approximation deals with the problem of approximating real or com...
investigate the error term of the asymptotic formula for the number of squarefree integers up to som...
This paper introduces a computational scheme for calculating the exponential bw where b and w a...
Recently, Borcherds [B] provided a striking description for the exponents in the naive infinite prod...
AbstractLet d(ω; α, γ) be the number of divisors of the Gaussian integer ω which lie in the arithmet...
Using elementary techniques, a question named after the famous Russian mathematician I. M. Gelfand i...
In this article we formalize in Mizar [1], [2] the maximum number of steps taken by some number theo...
In this masters thesis we prove by contradiction the irrationality of the numbers e, π 2 , and √n m,...
Abstract Let q ≥ 3 be a fixed positive integer, eq(n) denotes the largest exponent of power q which ...
study the Mertens product over primes in arithmetic progressions, and find a uniform version of prev...
ABSTRACT: For any positive integer n, let a{n) and b{n) denote the inferior and superior k-th power ...
We derive a lower bound for the arithmetic function M(n) = max {|a - b| : a, b ? ? n and ab ? 1 (mod...
We show that the exponent of distribution of the ternary divisor function $d_{3}$ in arithmetic prog...
AbstractWe use the explicit formula of V. Shevelev for the best possible exponent α(m) in the error ...
La présente thèse a été fortement influencée par deux conjectures, l'une de Gelfond et l'autre de Sa...
An important aspect of Diophantine Approximation deals with the problem of approximating real or com...
investigate the error term of the asymptotic formula for the number of squarefree integers up to som...
This paper introduces a computational scheme for calculating the exponential bw where b and w a...
Recently, Borcherds [B] provided a striking description for the exponents in the naive infinite prod...
AbstractLet d(ω; α, γ) be the number of divisors of the Gaussian integer ω which lie in the arithmet...
Using elementary techniques, a question named after the famous Russian mathematician I. M. Gelfand i...
In this article we formalize in Mizar [1], [2] the maximum number of steps taken by some number theo...
In this masters thesis we prove by contradiction the irrationality of the numbers e, π 2 , and √n m,...
Abstract Let q ≥ 3 be a fixed positive integer, eq(n) denotes the largest exponent of power q which ...
study the Mertens product over primes in arithmetic progressions, and find a uniform version of prev...
ABSTRACT: For any positive integer n, let a{n) and b{n) denote the inferior and superior k-th power ...
We derive a lower bound for the arithmetic function M(n) = max {|a - b| : a, b ? ? n and ab ? 1 (mod...
We show that the exponent of distribution of the ternary divisor function $d_{3}$ in arithmetic prog...
DOI
Add to ORKG