Related papers: Squarefree smooth numbers and Euclidean prime gene…

We show that the set of prime numbers has exponential alternating complexity, proving a conjecture by Fijalkow. We further show that the set of squarefree integers has essentially maximal possible alternating complexity.

This note determines an effective asymptotic formula for the number of squarefree totients $p-1$ with a fixed primitive root $u\ne \pm 1, v^2$.

We confirm several conjectures of Sun involving quadratic residues modulo odd primes. For any prime $p\equiv 1\pmod 4$ and integer $a\not\equiv0\pmod p$, we prove that \begin{align*}&(-1)^{|\{1\le k<\frac p4:\ (\frac kp)=-1\}|}\prod_{1\le…

In this paper we study the properties of an algorithm for generating continued fractions in the field of p-adic numbers $\mathbb{Q}_p$. First of all, we obtain an analogue of the Galois' Theorem for classical continued fractions. Then, we…

We have presented a multivariate polynomial function termed as factor elimination function,by which, we can generate prime numbers. This function's mapping behavior can explain the irregularities in the occurrence of prime numbers on the…

We present a variety of prime-generating constructions that are based on sums of primes. The constructions come in all shapes and sizes, varying in the number of dimensions and number of generated primes. Our best result is a construction…

We obtain an upper bound for the distribution of primes in the form $n^4 + k$ up to $x$, averaged over $k$ with small square-full part. As a corollary, we show that for almost all $k$, there is an expected amount of primes in the form $n^4…

For any odd prime number $p$, let $(\cdot|p)$ be the Legendre symbol, and let $n_1(p)<n_2(p)<\cdots$ be the sequence of positive nonresidues modulo $p$, i.e., $(n_k|p)=-1$ for each $k$. In 1957, Burgess showed that the upper bound…

In this paper, we obtain a lower bound for the number of primes $p\leq x$ such that $p-1$ is a sum of two squares and $p+2$ has a bounded number of prime factors. The proof uses the vector sieve framework, involving a semi-linear sieve and…

Given a prime $p\ge5$ and an integer $s\ge1$, we show that there exists an integer $M$ such that for any quadratic polynomial $f$ with coefficients in the ring of integers modulo $p^s$, such that $f$ is not a square, if a sequence…

The question of whether or not a given integral polynomial takes infinitely many square-free values has only been addressed unconditionally for polynomials of degree at most 3. We address this question, on average, for polynomials of…

Let $k\ge 1$ be an integer. A positive integer $n$ is $k$-\textit{gleeful} if $n$ can be represented as the sum of $k$th powers of consecutive primes. For example, $35=2^3+3^3$ is a $3$-gleeful number, and $195=5^2+7^2+11^2$ is $2$-gleeful.…

We give a method of constructing polynomials of arbitrarily large degree irreducible over a global field F but reducible modulo every prime of F. The method consists of finding quadratic f in F[x] whose iterates have the desired property,…

A modified Lagrange Polynomial is introduced for polynomial extrapolation, which can be used to estimate the equally spaced values of a polynomial function. As an example of its application, this article presents a prime-generating…

{\bf In the fourth extended version of this article, we provide a comprehensive historical survey of 200 different proofs of famous Euclid's theorem on the infinitude of prime numbers (300 {\small B.C.}--2022)}. The author is trying to…

In the present paper, we shall show that for any prime number p, every finite p-group occurs as the Galois Group of the maximal unramified p-extension over a certain number field of finite degree. We shall also show that for any given…

In the number $373$ all subwords ($3$, $7$, $37$, $73$, and $373$) are prime. Similarly, in $9719$ all subwords are divisible by at most one prime. And similarly again in $7319797913$ all subwords are divisible by at most two primes. These…

Let $\Gamma$ be a non-commutative free group on finitely many generators. In a previous work two of the authors have constructed the class of multiplicative representations of $\Gamma$ and proved them irreducible as representation of…

The author proves that there are infinitely many primes $p$ such that $\| \alpha p - \beta \| < p^{-\frac{28}{87}}$, where $\alpha$ is an irrational number and $\beta$ is a real number. This sharpens a result of Jia (2000) and provides a…

In this paper, we prove that for any $A>0$ there exist infinitely many primes $p$ for which sums of the Legendre symbol modulo $p$ over an interval of length $(\ln p)^A$ can take large values.