Related papers: A Result for Germain Primes

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

We prove a couple of related theorems including Legendre's and Andrica's conjecture. Key to the proofs is an algorithm that delivers the exact upper bound on the greatest gap that can occur in a combinatorial game with the set of P primes…

If $p$ is prime, a sequence of prime numbers $\{p, 2p+1, 4p+3,...,2^{n-1}(p+1)-1\}$ is called a Cunningham chain. These are finite sequences of prime numbers, for which each element but the last is a Sophie Germain prime. It is conjectured…

In this paper we establish explicit upper and lower bounds for the ratio of the arithmetic and geometric means of the prime numbers, which improve the current best estimates. Further, we prove several conjectures related to this ration…

We consider relatively prime integer numbers $m$ and $n$ such that each solvable group of order $mn$ has a normal subgroup of order $m$. We prove that each brace of size $mn$ is a semidirect product of a brace of size $m$ and a brace of…

We prove a lower bound on the canonical height associated to polynomials over number fields evaluated at points with infinite forward orbit. The lower bound depends only on the degree of the polynomial, the degree of the number field, and…

Recent results of Bourgain and Shparlinski imply that for almost all primes $p$ there is a multiple $mp$ that can be written in binary as $mp= 1+2^{m_1}+ \cdots +2^{m_k}, \quad 1\leq m_1 < \cdots < m_k,$ with $k=66$ or $k=16$, respectively.…

In this paper we show that for any prime number $p$ not equal to $11$ or $19$, the Tribonacci number $T_{p-1}$ is divisible by $p$ if and only if $p$ is of the form $x^2+11y^2$. We first use class field theory on the Galois closure of the…

A primorial prime is a prime number of the form $p_n\# \pm 1$ where $p_n\#$ denotes the product of all primes less than or equal to $p_{n}$, the $n$-th prime. We show that the probability along the lines of Mertens' Theorem that either…

We prove an exponential lower bound for general circuits computing the clique function and hereby confirm that NP != P.

The author gives nontrivial upper and lower bounds for the number of primes in the interval $[x - x^{\theta}, x]$ for some $0.52 \leqslant \theta \leqslant 0.525$, showing that the interval $[x - x^{0.52}, x]$ contains prime numbers for all…

We obtain an upper bound for the number of pairs $ (a,b) \in {A\times B} $ such that $ a+b $ is a prime number, where $ A, B \subseteq \{1,...,N \}$ with $|A||B| \, \gg \frac{N^2}{(\log {N})^2}$, $\, N \geq 1$ an integer. This improves on a…

We provide a lower bound on the probability that a binomial random variable is exceeding its mean. Our proof employs estimates on the mean absolute deviation and the tail conditional expectation of binomial random variables.

Using the link between mod $p$ Galois representations of $\qu$ and mod $p$ modular forms established by Serre's Conjecture, we compute, for every prime $p\leq 1999$, a lower bound for the number of isomorphism classes of continuous Galois…

This note presents a result on the maximal prime gap of the form p_(n+1) - p_n <= C(log p_n)^(1+e), where C > 0 is a constant, for any arbitrarily small real number e > 0, and all sufficiently large integer n > n_0. Equivalently, the result…

The article focuses on the problems of prime gaps and zero spacings. Possible solutions of several related problems such as the greatest lower bound, the least upper bound of the zero spacings, and the least upper bound of the prime gaps…

Using an idea of Doug Lind, we give a lower bound for the Perron-Frobenius degree of a Perron number that is not totally-real. As an application, we prove that there are cubic Perron numbers whose Perron-Frobenius degrees are arbitrary…

Let $X$ be a large parameter. We will first give a new estimate for the integral moments of primes in short intervals of the type $(p,p+h]$, where $p\leq X$ is a prime number and $h=\odi{X}$. Then we will apply this to prove that for every…

We prove explicit bounds for the number of sums of consecutive prime squares below a given magnitude.

The aim of this paper is to survey and extend results concerning bounds of the Euclidean minima of abelian number fields. In particular, we give upper bounds for the Euclidean minima of abelian number fields of prime power conductor.