Related papers: Fej\'er-Kernel Prime Indicators

Let $n$ be a positive square-free integer, where every odd prime factor of $n$ has form $8a\pm 1$. We determine when $n$ is non-congruent with second minimal $2$-primary Shafarevich-Tate group, in terms of the $4$-ranks of class groups and…

We present a simple, closed formula which gives all the primes in order. It is a simple product of integer floor and ceiling functions.

A positive integer $n$ is a Cayley number if every vertex-transitive graph of order $n$ is a Cayley graph. In 1983, Dragan Maru\v{s}i\v{c} posed the problem of determining the Cayley numbers. In this paper we give an infinite set $S$ of…

The function $\epsilon(x)=\mbox{li}(x)-\pi(x)$ is known to be positive up to the (very large) Skewes' number. Besides, according to Robin's work, the functions $\epsilon_{\theta}(x)=\mbox{li}[\theta(x)]-\pi(x)$ and…

The purpose of this note is to suggest an analogue for genus 2 curves of part of Gross and Zagier's work on elliptic curves. Experimentally, for genus 2 curves with CM by a quartic CM field K, it appears that primes dividing the…

The Golomb--Keller formula expresses the next prime $p_{n+1}$ as a recurrence relation in terms of the first $n$ primes $p_1, \ldots, p_n$ using the Riemann zeta function and an Euler product, but requires taking a limit as $s \to \infty$,…

Let p(n) be the nth prime and p(p(n)) be the nth prime-indexed prime (PIP). The process of taking prime-indexed subsequences of primes can be iterated, and the number of such iterations is the prime-index order. We report empirical evidence…

Let $\{p_j(n)\}_{j=1}^{\omega(n)}$ denote the increasing sequence of distinct prime factors of an integer $n$. For $z\geqslant 0$, let $G(n;z)$ denote the number of those indexes $j$ such that $p_{j+1}(n)>p_j(n)^{\exp z}$. We show uniform…

A primary pseudoperfect number (PPN) is an integer $K > 1$ such that the reciprocals of $K$ and its prime factors sum to 1. PPNs arise in studying perfectly weighted graphs and singularities of algebraic surfaces, and are related to…

Currently there is no known efficient formula for primes. Besides that, prime numbers have great importance in e.g., information technology such as public-key cryptography, and their position and possible or impossible functional generation…

In this paper we study the integrals of fractional parts of given functions, and develop some new tools to understand the behaviour of prime differences. We demonstrate how simply some seemingly difficult conjectures related to prime…

Let $\alpha\in]0,1]$ and let $Q_j$ $(1\leqslant j\leqslant r)$ denote distinct irreducible polynomials with integer coefficients. We show that, for vectors with coordinates not exceeding a constant multiple of their mean, the joint local…

It is well known that the distribution of the prime numbers plays a central role in number theory. It has been known, since Riemann's memoir in 1860, that the distribution of prime numbers can be described by the zero-free region of the…

We investigate some key analytic properties of Fourier coefficients and Hecke eigenvalues attached to scalar-valued Siegel cusp forms $F$ of degree 2, weight $k$ and level $N$. First, assuming that $F$ is a Hecke eigenform that is not of…

Let E be a real quadratic field with discriminant d and let p be an odd prime not dividing d. For \rho=1 or -1, we determine $\prod_{0<c<d, (d/c)=\rho} binomial coeff.{p-1}{\lfloor pc/d\rfloor}$ modulo p^2 in terms of Lucas numbers, the…

We prove a number of results regarding odd values of the Ramanujan $\tau$-function. For example, we prove the existence of an effectively computable positive constant $\kappa$ such that if $\tau(n)$ is odd and $n \ge 25$ then either \[…

For a pair of distinct non-CM newforms of weights at least 2, having rational integral Fourier coefficients $a_{1}(n)$ and $a_{2}(n)$, under GRH, we obtain an estimate for the set of primes $p$ such that $$ \omega(a_1(p)-a_2(p)) \le […

Motivated by their research on automorphism groups of pseudo-real Riemann surfaces, Bujalance, Cirre and Conder have conjectured that there are infinitely many primes $p$ such that $p+2$ has all its prime factors $q\equiv -1$ mod~$(4)$. We…

This work is a probabilistic study of the 'primes' of the Cram\'er model. We prove that there exists a set of integers $\mathcal S$ of density 1 such that \begin{equation}\liminf_{ \mathcal S\ni n\to\infty} (\log n)\mathbb{P} \{S_n\…

Odd numbers can be indexed by the map k(n)=(n-3)/2, n belonging to 2N+3. We first propose a basic primality test using this index function that was first introduced in article (8). Input size of operations is reduced which improves…