Related papers: Vinogradov's three primes theorem with primes havi…

In this article, we investigate factorization problems for twisted triple product Galois representations over real quadratic fields, arising from families of Hilbert cusp forms. Specifically, we address the factorization in two distinct…

This paper is continuation of the paper "Primitive roots in quadratic field". We consider an analogue of Artin's primitive root conjecture for algebraic numbers which is not a unit in real quadratic fields. Given such an algebraic number,…

Let $\mathbf{f} = (f_1, \ldots, f_R)$ be a system of polynomials with integer coefficients in which the degrees need not all be the same. We provide sufficient conditions for which the system of equations $f_j (x_1, \ldots, x_n) = 0 \ (1…

We prove asymptotic formulas for counting (primitive) integral points with local conditions on the (punctured) affine cone defined by a non-singular integral ternary quadratic form, and we relate our results to the Brauer--Manin…

A primitive root modulo an integer $n$ is the generator of the multiplicative group of integers modulo $n$. Gauss proved that for any prime number $p$ greater than $3$, the sum of its primitive roots is congruent to $1$ modulo $p$ while its…

We adopt a physically motivated empirical approach to the characterisation of the distributions of twin and triplet primes within the set of primes, rather than in the set of all natural numbers. Remarkably, the occurrences of twins or…

Can one find an integer $g$ and a polynomial $f$, such that $g$ is a primitive root for many consecutive (different) prime values assumed by $f$? Moree considered this problem in 2007 with computational assistence from Gallot and…

Let $E$ be a semistable elliptic curve over $\mathbb{Q}$. We prove that if $E$ has non-split multiplicative reduction at at least one odd prime or split multiplicative reduction at at least two odd primes and if the rank of $E(\mathbb{Q})$…

In this paper, we study the hybrid problem of Hua's theorem and the Piatetski-Shapiro prime number theorem, and obtain results in this direction of the nonhomogeneous case $k=3$, which deepen the classical result of Hua.

This open problem, first posed by Erd{\omicron}s, was further explored by Terence Tao. Tao work shows that the series can converge conditionally, but only under a sufficiently strong form of the Hardy-Littlewood conjecture for k-primary…

Motivated by previous work leveraging factorizations of second- and fourth-order differential operators, a general integral inequality involving higher order derivatives is proven by elementary means. It is then shown how this framework…

Let C be some class of objects equipped with a set of simplifying moves. When we apply these to a given object M in C as long as possible, we get a root of M. Our main result is that under certain conditions the root of any object exists…

For any fixed $k\geq 2$, we prove that every sufficiently large integer can be expressed as the sum of a $k$th power of a prime and a number with at most $M(k)=6k$ prime factors. For sufficiently large $k$ we also show that one can take…

We consider a first-order logic for the integers with addition. This logic extends classical first-order logic by modulo-counting, threshold-counting and exact-counting quantifiers, all applied to tuples of variables (here, residues are…

Suppose P is a set of primes, such that for every p in P, every prime factor of p-1 is also in P. If P does not contain all primes, we apply a new sieve method to show that the counting function of P is O(x^{1-c}) for some c>0, where c…

When Newton's method, or Halley's method is used to approximate the $p${th} root of $1-z$, a sequence of rational functions is obtained. In this paper, a beautiful formula for these rational functions is proved in the square root case,…

In this paper, we proved a theorem that every large enough odd number can be represented as the sum of three almost equal Piatetski-Shapiro primes.

We extend the character sum method for the computation of densities in Artin primitive root problems developed by H. W. Lenstra and the authors to the situation of radical extensions of arbitrary rank. Our algebraic set-up identifies the…

A set of integers greater than 1 is primitive if no element divides another. Erd\H{o}s proved in 1935 that the sum of $1/(n \log n)$ for $n$ running over a primitive set $A$ is universally bounded over all choices for $A$. In 1988 he asked…

D.H. Lehmer found a quadratic polynomial such that 326 is a primitive root for the first 206 primes represented by this polynomial. It is shown that this is related to the class number one problem and prime producing quadratics. An…