Let ${𝒫}_2$ denote a positive integer with at most $2$ prime factors, counted according to multiplicity. For integers $a$, $q$ such that $(a,q)=1$, let ${𝒫}_2(q,a)$ denote the least ${𝒫}_2$ in the arithmetic progression ${\{nq+a\}}_{n=1}^{\infty }$. It is proved that for sufficiently large $q$, we have $${𝒫}_2(q,a)\ll q^{1.825}.$$ This result constitutes an improvement upon that of J. Li, M. Zhang and Y. Cai (2023), who obtained ${𝒫}_2(q,a)\ll q^{1.8345}.$

Let ${𝒫}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. Suppose that $a$ and $q$ are positive integers satisfying $(a,q)=1$. Denote by ${𝒫}_2(a,q)$ the least almost-prime ${𝒫}_2$ which satisfies ${𝒫}_2\equiv a(modq)$. It is proved that for sufficiently large $q$, there holds $${𝒫}_2(a,q)\ll q^{1.8345}.$$ This result constitutes an improvement upon that of Iwaniec (1982), who obtained the same conclusion, but for the range $1.845$ in place of $1.8345$.

Let $a$ and $b\in \mathbb{N}$. Denote by $R_{a,b}$ the set of all integers $n>1$ whose canonical prime representation $n=p_1^{{\alpha }_1}{p}_2^{{\alpha }_2}\cdots p_r^{{\alpha }_r}$ has all exponents ${\alpha }_i$ $(1\le i\le r)$ being a multiple of $a$ or belonging to the arithmetic progression $at+b$, $t\in {\mathbb{N}}_0:=\mathbb{N}\cup \left\{0\right\}$. All integers in $R_{a,b}$ are called generalized square-full integers. Using the exponent pair method, an upper bound for character sums over generalized square-full integers is derived. An application on the distribution of generalized square-full integers in an arithmetic progression is given. ...

Let $p_1,p_2,\cdots$ be the sequence of all primes in ascending order. Using explicit estimates from the prime number theory, we show that if $k\ge 5$, then $$(p_{k+1}-1)!\mid \left(\frac{1}{2}(p_{k+1}-1)\right)!p_k!,$$ which improves a previous result of the second author.

Given an integer $n\ge 3$, let $u_1,...,u_n$ be pairwise coprime integers $\ge 2$, $𝒟$ a family of nonempty proper subsets of $\{1,...,n\}$ with “enough” elements, and $\epsilon$ a function $𝒟\to \{\pm 1\}$. Does there exist at least one prime $q$ such that $q$ divides ${\prod }_{i\in I}{u}_i-\epsilon \left(I\right)$ for some $I\in 𝒟$, but it does not divide $u_1\cdots u_n$? We answer this question in the positive when the $u_i$ are prime powers and $\epsilon$ and $𝒟$ are subjected to certain restrictions. We use the result to prove that, if ${\epsilon }_0\in \{\pm 1\}$ and $A$ is a set of three or more primes that contains all prime divisors of any...

Some mean value theorems in the style of Bombieri-Vinogradov’s theorem are discussed. They concern binary and ternary additive problems with primes in arithmetic progressions and short intervals. Nontrivial estimates for some of these mean values are given. As application inter alia, we show that for large odd $n\neg \equiv 1\left(6\right)$, Goldbach’s ternary problem $n=p_1+p_2+p_3$ is solvable with primes $p_1,p_2$ in short intervals $p_i\in [X_i,X_i+Y]$ with $X_i^{{\theta }_i}=Y$, $i=1,2$, and ${\theta }_1,{\theta }_2\ge 0.933$ such that $(p_1+2)(p_2+2)$ has at most $9$ prime factors.

For the dynamics $x^{\text{'}\text{'}}=-{\nabla }_{x}V\left(x\right)$, an equilibrium point $\underline{x}$ are always unstable when on a neighborhood of $\underline{x}$ the non constant $V$ satisfies $P(x,\partial )V=0$ for a real second order elliptic $P$. The proof uses a result of Kozlov [6].

Let $\mathbb{Z}$ be the set of integers, ${\mathbb{N}}_0$ the set of nonnegative integers and $F(x_1,x_2)=u_1{x}_1+u_2{x}_2$ be a binary linear form whose coefficients $u_1$, $u_2$ are nonzero, relatively prime integers such that $u_1{u}_2\ne \pm 1$ and $u_1{u}_2\ne -2$. Let $f:\mathbb{Z}\to {\mathbb{N}}_0\cup \left\{\infty \right\}$ be any function such that the set $f^{-1}\left(0\right)$ has asymptotic density zero. In 2007, M. B. Nathanson (2007) proved that there exists a set $A$ of integers such that $r_{A,F}\left(n\right)=f\left(n\right)$ for all integers $n$, where $r_{A,F}\left(n\right)=\left|\{(a,a^{\text{'}}):n=u_{1}a+u_2{a}^{\text{'}}:a,a^{\text{'}}\in A\}\right|$. We add the structure of difference for the binary linear form $F(x_1,x_2)$.

We use the estimation of the number of integers $n$ such that $\lfloor n^c\rfloor$ belongs to an arithmetic progression to study the coprimality of integers in ${\mathbb{N}}^c={\left\{\lfloor n^c\rfloor \right\}}_{n\in \mathbb{N}}$, $c>1$, $c\notin \mathbb{N}$.

Let d be a positive integer and μ a generalized Cantor measure satisfying $\mu ={\sum }_{j=1}^m{a}_j\mu \circ S_j^{-1}$, where $0<a_j<1$, ${\sum }_{j=1}^m{a}_j=1$, $S_j=\rho R+b_j$ with 0 < ρ < 1 and R an orthogonal transformation of ${ℝ}^d$. Then ⎧1 < p ≤ 2 ⇒ ⎨$su{p}_{r>0}{r}^{d(1/{\alpha }^{\text{'}}-1/p^{\text{'}})}({\int }_{J_x^r}{\left|\mu ̂\left(y\right)\right|}^{p^{\text{'}}}{dy)}^{1/p^{\text{'}}}\le D₁{\rho }^{-d/{\alpha }^{\text{'}}}$, $x\in {ℝ}^d$, ⎩ p = 2 ⇒ infr≥1 rd(1/α’-1/2) (∫J₀r|μ̂(y)|² dy)1/2 ≥ D₂ρd/α’$,$where $J_x^r={\prod }_{i=1}^d(x_i-r/2,x_i+r/2)$, α’ is defined by ${\rho }^{d/{\alpha }^{\text{'}}}={\left({\sum }_{j=1}^m{a}_j^p\right)}^{1/p}$ and the constants D₁ and D₂ depend only on d and p.