We prove that almost all positive even integers $n$ can be represented as $p_2^2+p_3^3+p_4^4+p_5^5$ with $|p_k^k-\frac{1}{4}N|\le N^{1-1/54+\epsilon }$ for $2\le k\le 5$. As a consequence, we show that each sufficiently large odd integer $N$ can be written as $p_1+p_2^2+p_3^3+p_4^4+p_5^5$ with $|p_k^k-\frac{1}{5}N|\le N^{1-1/54+\epsilon }$ for $1\le k\le 5$.

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.

Let p be a prime, ℤₚ be the finite field in p elements, k be a positive integer, and A be the multiplicative subgroup of nonzero kth powers in ℤₚ. The goal of this paper is to determine, for a given positive integer s, a value tₛ such that if |A| ≫ tₛ then every element of ℤₚ is a sum of s kth powers. We obtain $t₄=p^{22/39+ϵ}$, $t₅=p^{15/29+ϵ}$ and for s ≥ 6, $tₛ=p^{(9s+45)/(29s+33)+ϵ}$. For s ≥ 24 further improvements are made, such as $t_{32}=p^{5/16+ϵ}$ and $t_{128}=p^{1/4}$.

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 $N$ be a sufficiently large integer. We prove that almost all sufficiently large even integers $n\in [N-6U,N+6U]$ can be represented as $$n=p_1^2+p_2^3+p_3^3+p_4^3+p_5^3+p_6^3,\left|p_1^2-{\displaystyle \frac{N}{6}}\right|\le U,\left|p_i^3-{\displaystyle \frac{N}{6}}\right|\le U,i=2,3,4,5,6,$$ where $U=N^{1-\delta +\epsilon }$ with $\delta \le 8/225$.

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...

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 $\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)$.

Let $𝒱$ be a fixed algebraic variety defined by $m$ polynomials in $n$ variables with integer coefficients. We show that there exists a constant $C\left(𝒱\right)$ such that for almost all primes $p$ for all but at most $C\left(𝒱\right)$ points on the reduction of $𝒱$ modulo $p$ at least one of the components has a large multiplicative order. This generalises several previous results and is a step towards a conjecture of B. Poonen.

We discuss the validity of the Helmholtz decomposition of the Muckenhoupt $A_p$-weighted $L^p$-space ${\left(L_w^p\left(\Omega \right)\right)}^n$ for any domain $\Omega$ in ${ℝ}^n$, $n\in \mathbb{Z}$, $n\ge 2$, $1<p<\infty$ and Muckenhoupt $A_p$-weight $w\in A_p$. Set $p^{\text{'}}:=p/(p-1)$ and $w^{\text{'}}:=w^{-1/(p-1)}$. Then the Helmholtz decomposition of ${\left(L_w^p\left(\Omega \right)\right)}^n$ and ${\left(L_{w^{\text{'}}}^{p^{\text{'}}}\left(\Omega \right)\right)}^n$ and the variational estimate of $L_{w,\pi }^p\left(\Omega \right)$ and $L_{w^{\text{'}},\pi }^{p^{\text{'}}}\left(\Omega \right)$ are equivalent. Furthermore, we can replace $L_{w,\pi }^p\left(\Omega \right)$ and $L_{w^{\text{'}},\pi }^{p^{\text{'}}}\left(\Omega \right)$ by $L_{w,\sigma }^p\left(\Omega \right)$ and $L_{w^{\text{'}},\sigma }^{p^{\text{'}}}\left(\Omega \right)$, respectively. The proof is based on the reflexivity and orthogonality of $L_{w,\pi }^p\left(\Omega \right)$ and $L_{w,\sigma }^p\left(\Omega \right)$ and the Hahn-Banach theorem. As a corollary of our main result, we obtain the extrapolation...

Consider the linear congruence equation $x_1+...+x_k\equiv b(mod{n}^s)$ for $b\in \mathbb{Z}$, $n,s\in \mathbb{N}$. Let ${(a,b)}_s$ denote the generalized gcd of $a$ and $b$ which is the largest $l^s$ with $l\in \mathbb{N}$ dividing $a$ and $b$ simultaneously. Let $d_1,...,d_{\tau \left(n\right)}$ be all positive divisors of $n$. For each $d_j\mid n$, define ${𝒞}_{j,s}\left(n\right)=\{1\le x\le n^s:{(x,n^s)}_s=d_j^s\}$. K. Bibak et al. (2016) gave a formula using Ramanujan sums for the number of solutions of the above congruence equation with some gcd restrictions on $x_i$. We generalize their result with generalized gcd restrictions on $x_i$ and prove that for the above linear congruence, the...

Let ${\sigma }_A\left(n\right)=\left|(a,a^{\text{'}})\in A²:a+a^{\text{'}}=n\right|$, where n ∈ N and A is a subset of N. Erdős and Turán conjectured that for any basis A of order 2 of N, ${\sigma }_A\left(n\right)$ is unbounded. In 1990, Imre Z. Ruzsa constructed a basis A of order 2 of N for which ${\sigma }_A\left(n\right)$ is bounded in the square mean. In this paper, we show that there exists a positive integer m₀ such that, for any integer m ≥ m₀, we have a set A ⊂ Zₘ such that A + A = Zₘ and ${\sigma }_A\left(n̅\right)\le 768$ for all n̅ ∈ Zₘ.

A new approach to differentiation on a time scale is presented. We give a suitable generalization of the Vitali Lemma and apply it to prove that every increasing function f: → ℝ has a right derivative f₊’(x) for ${\mu }_{\Delta }$-almost all x ∈ . Moreover, ${\int }_{[a,b)}f{₊}^{\text{'}}\left(x\right)d{\mu }_{\Delta }\le f\left(b\right)-f\left(a\right)$.