Add to ORKGLet N(n < x: P) denote the number of positive integers n ^ x with the property P. In an earlier paper (1) we obtained an asymptotic formula for N(n < x: qm\\crv(n)), where q is a prime, m and v are positive integers,
summary:Let $[x]$ be an integer part of $x$ and $d(n)$ be the number of positive divisor of $n$. Ins...
Abstract. In this paper, we study the asymptotic behavior of the number of composite integers writte...
A sequence of rational integers g is called a divisibility sequence if and only if n | m ⇒ g(n) | g...
summary:A certain generalized divisor function $d^*(n)$ is studied which counts the number of factor...
For a positive integer n we let τ(n) denote the number of its positive divisors. In this paper, we o...
This thesis gives some order estimates and asymptotic formulae associated with general classes of no...
Let ϕ(·) denote the Euler function, and let a> 1 be a fixed integer. We study several divisibilit...
AbstractFor a fixed prime q, let eq(n) denote the order of q in the prime factorization of n!. For t...
The divisor function $\tau(n)$ counts the number of positive divisors of an integer n. We are concer...
In this thesis, we will study a class of divisor functions: the prime symmetric functions. These are...
ABSTRACT: For any positive integer n, let a{n) and b{n) denote the inferior and superior k-th power ...
Let P(x,d,a) denote the number of primes p<=x with p=a(mod d). Chebyshev's bias is the phenomenon th...
Introduction. Let k be a positive integer and F(x, k) denote the number of integers n < x which h...
We study prime divisors of various sequences of positive integers A(n) + 1, n = 1,...,N, such that t...
Let (un)n≥₀ be a non-degenerate linear recurrence sequence of integers. We show that the set of posi...
summary:Let $[x]$ be an integer part of $x$ and $d(n)$ be the number of positive divisor of $n$. Ins...
Abstract. In this paper, we study the asymptotic behavior of the number of composite integers writte...
A sequence of rational integers g is called a divisibility sequence if and only if n | m ⇒ g(n) | g...
summary:A certain generalized divisor function $d^*(n)$ is studied which counts the number of factor...
For a positive integer n we let τ(n) denote the number of its positive divisors. In this paper, we o...
This thesis gives some order estimates and asymptotic formulae associated with general classes of no...
Let ϕ(·) denote the Euler function, and let a> 1 be a fixed integer. We study several divisibilit...
AbstractFor a fixed prime q, let eq(n) denote the order of q in the prime factorization of n!. For t...
The divisor function $\tau(n)$ counts the number of positive divisors of an integer n. We are concer...
In this thesis, we will study a class of divisor functions: the prime symmetric functions. These are...
ABSTRACT: For any positive integer n, let a{n) and b{n) denote the inferior and superior k-th power ...
Let P(x,d,a) denote the number of primes p<=x with p=a(mod d). Chebyshev's bias is the phenomenon th...
Introduction. Let k be a positive integer and F(x, k) denote the number of integers n < x which h...
We study prime divisors of various sequences of positive integers A(n) + 1, n = 1,...,N, such that t...
Let (un)n≥₀ be a non-degenerate linear recurrence sequence of integers. We show that the set of posi...
summary:Let $[x]$ be an integer part of $x$ and $d(n)$ be the number of positive divisor of $n$. Ins...
Abstract. In this paper, we study the asymptotic behavior of the number of composite integers writte...
A sequence of rational integers g is called a divisibility sequence if and only if n | m ⇒ g(n) | g...