summary:In this note, we show that the counting function of the number of composite positive integers $n\le x$ such that $\beta (n)=\sum _{p\mid n} p$ is a prime is of order of magnitude at least $x/(\log x)^3$ and at most $x/ \log x$
Thesis (M.A.)--Boston University.In Chapter 1 of this thesis we give some elementary definitions and...
First published in Mathematical Research Letters 11 (2004) nos.5-6, pp.853-868, published by Interna...
We are interested in classifying those sets of primes P such that when we sieve out the integers ...
summary:In this note, we show that the counting function of the number of composite positive integer...
AbstractWe prove that for almost all n, the numerator of the Bernoulli number B2n is divisible by a ...
AbstractWe prove a Bombieri–Vinogradov type result for linear exponential sums over primes. Then we ...
summary:In this note, we show that the counting function of the number of composite positive integer...
http://www.math.missouri.edu/~bbanks/papers/index.htmlIn this note, we study those positive integers...
For a set of primes P, let Ψ(x;P) be the number of positive integers n≤x all of whose prime factors ...
Gerard and Washington proved that, for k > -1, the number of primes less than xk+1 can be well ap...
Gerard and Washington proved that, for k > -1, the number of primes less than xk+1 can be well ap...
AbstractIn this paper we modify the usual sieve methods to study the distribution of almost primes i...
AbstractThe number defined by the title is denoted by Ψ(x, y). Let u = log xlog y and let ϱ(u) be th...
In this paper, we develop a novel analytic method to prove the prime number theorem in de la Vall\'e...
AbstractIt is shown that the number of integersnfor whichn∈(x−xθ, x] andnhaving at most two prime fa...
Thesis (M.A.)--Boston University.In Chapter 1 of this thesis we give some elementary definitions and...
First published in Mathematical Research Letters 11 (2004) nos.5-6, pp.853-868, published by Interna...
We are interested in classifying those sets of primes P such that when we sieve out the integers ...
summary:In this note, we show that the counting function of the number of composite positive integer...
AbstractWe prove that for almost all n, the numerator of the Bernoulli number B2n is divisible by a ...
AbstractWe prove a Bombieri–Vinogradov type result for linear exponential sums over primes. Then we ...
summary:In this note, we show that the counting function of the number of composite positive integer...
http://www.math.missouri.edu/~bbanks/papers/index.htmlIn this note, we study those positive integers...
For a set of primes P, let Ψ(x;P) be the number of positive integers n≤x all of whose prime factors ...
Gerard and Washington proved that, for k > -1, the number of primes less than xk+1 can be well ap...
Gerard and Washington proved that, for k > -1, the number of primes less than xk+1 can be well ap...
AbstractIn this paper we modify the usual sieve methods to study the distribution of almost primes i...
AbstractThe number defined by the title is denoted by Ψ(x, y). Let u = log xlog y and let ϱ(u) be th...
In this paper, we develop a novel analytic method to prove the prime number theorem in de la Vall\'e...
AbstractIt is shown that the number of integersnfor whichn∈(x−xθ, x] andnhaving at most two prime fa...
Thesis (M.A.)--Boston University.In Chapter 1 of this thesis we give some elementary definitions and...
First published in Mathematical Research Letters 11 (2004) nos.5-6, pp.853-868, published by Interna...
We are interested in classifying those sets of primes P such that when we sieve out the integers ...
DOI
Add to ORKG