Related papers: On prime-generating linear polynomials and x^2+1

Let $a$ and $b$ be positive integers and let $p$ be an odd prime such that $p=ax^2+by^2$ for some integers $x$ and $y$. Let $\lambda(a,b;n)$ be given by $q\prod_{k=1}^\infty (1-q^{ak})^3(1-q^{bk})^3 = \sum_{n=1}^\infty \lambda(a,b;n)q^n$.…

In the paper, the occurrence of zeros and ones in the binary expansion of the primes is studied. In particular the statement in the title is established. The proof is unconditional.

This article proves that there are infinitely many primes of the form a^2 + b^4, in fact getting the asymptotic formula. The main result is that \sum_{a^2 + b^4\le x} \Lambda(a^2 + b^4) = 4\pi^{-1}\kappa x^{3/4} (1 + O(\log\log x / \log x))…

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…

Polignac [1] conjectured that for every even natural number $2k (k\geq1)$, there exist infinitely many consecutive primes $p_n$ and $p_{n+1}$ such that $p_{n+1}-p_n=2k$. A weakened form of this conjecture states that for every $k\geq1$,…

In this paper, we establish a Bombieri-Vinogradov type result for prime numbers of the form $p=x^2+y^2+1$. The proof is based on the enveloping sieve.

We prove that there are infinitely many integers $n$ such that $n$ and $n+1$ have the same number of distinct prime divisors.

Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.

The unique prime factorization theorem is used to show the existence of a function on a countable set $\mathcal{X}$ so that the sum aggregator function is injective on all multisets of $\mathcal{X}$ of finite size.

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…

We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart from some small counterexamples, when a term has a primitive divisor, that primitive divisor is unique. It seems likely that the number of…

{\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…

We show that there are infinitely many primes of the form $X^2+(Y^2+1)^2$ and $X^2+(Y^3+Z^3)^2$. This extends the work of Friedlander and Iwaniec showing that there are infinitely many primes of the form $X^2+Y^4$. More precisely,…

The aim of this paper is to try to establish a generic model for the problem that several multivariable number-theoretic functions represent simultaneously primes for infinitely many integral points. More concretely, we introduced briefly…

We prove an asymptotic formula for the number of primes of the shape $a^2 +p^4$, thereby refining the well known work of Friedlander and Iwaniec. Along the way, we prove a result on equidistribution of primes up to $x$, in which the moduli…

In this note, we use the concept of a polynomial ring to give an elementary proof to Cayley-Hamilton Theorem. We also give an elementary proof to Birkhoff theorem on Bi-stochastic matrices.

Comments about the paper by Elsholz, Fermat's last theorem implies Euclid's infinitude of primes, (2021), and simplification.

We give an exact coefficients formula of any infinite product of power series with constant term equal to $1$, by using structures from partitions of integers and permutation groups. This is an universal theorem for various of Binomial-type…

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…

Starting with Zhang's theorem on the infinitude of prime doubles, we give an inductive argument that there exists an infinite number of prime $k$-tuples for at least one admissible set $\mathcal{H}_k=\{h_1,\ldots,h_k\}$ for each $k$.