相关论文: A Hardy-Ramanujan type inequality for shifted prim…

The well-known Hardy--Ramanujan inequality states that if $\omega(n)$ denotes the number of distinct prime factors of a positive integer $n$, then there is an absolute constant $C>0$ such that uniformly for $x\ge2$ and $k\in\mathbb{N}$,…

We estimate from below the lower density of the set of prime numbers p such that p-1 has a prime factor of size at least p^c, where c lies in between 1/4 and 1/2. We also establish upper and lower bounds on the counting function of the set…

We develop an analog for shifted primes of the Kubilius model of prime factors of integers. We prove a total variation distance estimate for the difference between the model and actual prime factors of shifted primes, and apply it to show…

We give some theoretical and computational results on "random" harmonic sums with prime numbers, and more generally, for integers with a fixed number of prime factors.

In 1917, G.H.Hardy and S.Ramanujan proved that the `typical' number of prime factors of a positive integer $n$ is approximately $\ln\ln n$. In this technical paper we proffer a complete exposition of this proof, and further provide novel…

Let $r \ge 2$ be an integer and let $A$ be a finite, nonempty set of nonzero integers. We will obtain a lower bound for the number of squarefree integers $n$, up to $x$, for which the products $\prod_{p \mid n} (p+a)$ (over primes $p$) are…

We bound from below the number of shifted primes p+s<x that have a divisor in a given interval (y,z]. Kevin Ford has obtained upper bounds of the expected order of magnitude on this quantity as well as lower bounds in a special case of the…

Let $\omega(n)$ denote the number of distinct prime factors of $n$. Then for any given $K\geq 2$, small $\epsilon>0$ and sufficiently large (only depending on $K$ and $\epsilon$) $x$, there exist at least $x^{1-\epsilon}$ integers…

In this paper we establish several results concerning the generalized Ramanujan primes. For $n\in\mathbb{N}$ and $k \in \mathbb{R}_{> 1}$ we give estimates for the $n$th $k$-Ramanujan prime which lead both to generalizations and to…

Let $x$ and $n$ be positive integers. We prove a non-trivial lower bound for $x$, dependant only on $\omega_n$, the number of distinct prime factors of $x^n-1$. By considering the divisibility of $\varphi \mid x^n-1$ for $\varphi \mid n$,…

\begin{abstract} For the Hardy space $H^p(\mathbb{R}^{d})$, $ 0<p\leq 1,$ we shall improve a Hardy's type inequality associated with Dunkl transform respect to the measures $d\mu_{k}$ homogeneous of degree $\gamma ,$ on the strip…

We obtain an asymptotic formula for the number of primes $p\leq x_1$, $p\leq x_2$ such that $p_1(p_2+a)\equiv l \pmod q$ with $(a,q)=(l,q)=1$, $q\leq x^{\kappa_0}$, $x_1\geq x^{1-\alpha}$, $x_2\geq x^{\alpha}$, $$…

We derive the asymptotic formula for $p_n(N,M)$, the number of partitions of integer $n$ with part size at most $N$ and length at most $M$. We consider both $N$ and $M$ are comparable to $\sqrt{n}$. This is an extension of the classical…

In this paper, we introduce some explicit approximations for the summation $\sum_{k\leq n}\Omega(k)$, where $\Omega(k)$ is the total number of prime factors of $k$.

We prove lower bounds for the number of primes $p \leq N + b$ such that $p-b$ is divisible by $2^{k(N)}$ and has at most $k$ odd prime factors ($k \geq 2$), assuming $2^{k(N)} \leq N^\theta$ for some $\theta > 0$ depending on $k$. The proof…

A highly strong upper estimate in the modified asymptotic formula for sums of the primes' reciprocals is proved to be necessary (as well as sufficient) in order the Ramanujan inequality holds true. Some other criteria in similar terms are…

We extend Hardy's inequality from sequences of non-negative numbers to sequences of positive semi-definite operators if the parameter p satisfies 1<p<=2, and to operators under a trace for arbitrary p>1. Applications to trace functions are…

A classic question in analytic number theory is to find asymptotics for $\sigma_{k}(x)$ and $\pi_{k}(x)$, the number of integers $n\leq x$ with exactly $k$ prime factors, where $\pi_{k}(x)$ has the added constraint that all the factors are…

Let $p_{r,s}(n)$ denote the number of partitions of a positive integer $n$ into parts containing no multiples of $r$ or $s$, where $r>1$ and $s>1$ are square-free, relatively prime integers. We use classical methods to derive a…

In this paper, we give a new upper bound for the number $N_{\mathcal{R}}$ which is defined to be the smallest positive integer such that a certain inequality due to Ramanujan involving the prime counting function $\pi(x)$ holds for every $x…