Related papers: About de Polignac's conjecture

Legendre's Conjecture is one of the most elegant open problems in Number Theory, which states that there is a prime between consecutive two perfect squares. In this note, we prove the conjecture holds true and also discuss the related…

We study the value-distribution of Dirichlet polynomials on the critical line $\Re(s)=\tfrac{1}{2}$. As a consequence, we prove a corollary on small consecutive gaps between zeros of the Riemann zeta function. We also examine the…

We showed that the prime gap for a prime number p is less than or equal to the prime count of the prime number.

Using the method of multiple Dirichlet series, we develop L-functions ratios conjecture with one shift in both the numerator and denominator in certain ranges for quadratic families of Dirichlet and Hecke L-functions of primerelated moduli…

We prove the existence of primitive sets (sets of integers in which no element divides another) in which the gap between any two consecutive terms is substantially smaller than the best known upper bound for the gaps in the sequence of…

We primarily investigate congruences modulo $p$ for finite sums of the form $\sum_k\binom{rk}{k}x^k/k$ over the ranges $0<k<p$ and $0<k<p/r$, where $p$ is a prime larger than the positive integer $r$. Here $x$ is an indeterminate, thus…

An extension of the Legendre transform to non-convex functions with vanishing Hessian as a mix of envelope and general solutions of the Clairaut equation is proposed. Applying this to systems with constraints, the procedure of finding a…

We propose a new approach to the combinatorial interpretations of linearization coefficient problem of orthogonal polynomials. We first establish a difference system and then solve it combinatorially and analytically using the method of…

Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p \ge 11$ and integer $r\ge 2$, we prove that $$ \sum\limits_{\begin{smallmatrix}…

In this article, we derive a congruence property of particular sum rules involving prime numbers. The resulting expression involves Bernoulli numbers and polynomials, for which we obtain, as a consequence, a general congruence relation as…

We give bounds for the number and the size of the primes $p$ such that a reduction modulo $p$ of a system of multivariate polynomials over the integers with a finite number $T$ of complex zeros, does not have exactly $T$ zeros over the…

We have recently show that Poincare series of Hyperbolic Lie algebras have the form of a ratio between Poincare series of a chosen finite Lie algebra and a polynomial of finite degree. By the aid of some properly chosen examples, we now…

This document seeks to prove there are infinitely many primes whose difference is 2, referred to as twin prime pairs. This proof's methodology involves constructing a function that approximates the number of positive integers, less than a…

In this short note we present a class of conjectures on partitions of integers as summations of primes, which are extensions of Goldbach conjecture.

Let $1\leq a<q$ be a pair of small integers such that $\gcd(a,q)=1$ and let $x>1$ be a large number. This note discusses the existence of a short sequence of primes $p\equiv a\bmod q$ between two squares $x^2$ and $(x+1)^2$.

Multiplicative arithmetic functions satisfying the parallelogram functional equation on prime numbers are investigated. It is derived that the unique solution is a quadratic function by the Goldbach's conjecture.

We give elementary proofs of some congruence criteria to compute binomial coefficients in modulo a prime. These criteria are analogues to the symmetry property of binomial coefficients. We give extended version of Lucas Theorem by using…

The goal of the present paper is to present a method of proving of Diophantine inequalities with primes through the use of auxiliary inequalities and available evaluations of the difference between consecutive primes. We study the Legendre…

It is shown that the first $n$ prime numbers $p_1,...,p_n$ determine the next one by the recursion equation $$ p_{n+1} =\lim\limits_{s\to +\infty} [\prod\limits^n_{k=1} (1-\frac{1}{p^s_k}) \sum\limits^\infty_{j=1} \frac{1}{j^s} -1]^{-1/s}.…

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…