English
Related papers

Related papers: A Result for Germain Primes

200 papers

Using an explicit version of Selberg's upper sieve, we obtain explicit upper bounds for the number of $n\leq x$ such that a non-empty set of irreducible polynomials $F_i(n)$ with integer coefficients are simultaneously prime; this set can…

Number Theory · Mathematics 2022-11-22 Matteo Bordignon , Ethan Simpson Lee

We consider the Gaussian limit law for the distribution of the middle prime factor of an integer, defined according to multiplicity or not. We obtain an optimal bound for the speed of convergence, thereby improving on previous estimates…

Number Theory · Mathematics 2025-04-29 Jonathan Rotgé

In this paper we propose necessary upper bounds for the second, third and fourth smallest prime divisors of friends of 10 based on the number of distinct prime divisors of it.

General Mathematics · Mathematics 2025-02-14 Sourav Mandal , Sagar Mandal

We consider the problem of bounding away from 0 the minimum value m taken by a polynomial P of Z[X_1,...,X_k] over the standard simplex, assuming that m>0. Recent algorithmic developments in real algebraic geometry enable us to obtain a…

Symbolic Computation · Computer Science 2009-02-20 Saugata Basu , Richard Leroy , Marie-Francoise Roy

Let $K\geq 2$ be a natural number and $a_i,b_i\in\mathbb{Z}$ for $i=1,\ldots,K-1$. We use the large sieve to derive explicit upper bounds for the number of prime $k$-tuplets, i.e., for the number of primes $p\leq x$ for which all $a_ip+b_i$…

Number Theory · Mathematics 2024-09-09 Thomas Dubbe

In this paper we prove a new recurrence relation on the van der Waerden numbers, $w(r,k)$. In particular, if $p$ is a prime and $p\leq k$ then $w(r, k) > p \cdot \left(w\left(r - \left\lceil \frac{r}{p}\right\rceil, k\right) -1\right)$.…

Combinatorics · Mathematics 2018-07-27 Thomas Blankenship , Jay Cummings , Vladislav Taranchuk

Under mild conditions on $n,p$, we give a lower bound on the number of $n$-variable balanced symmetric polynomials over finite fields $GF(p)$, where $p$ is a prime number. The existence of nonlinear balanced symmetric polynomials is an…

Combinatorics · Mathematics 2007-05-23 Thomas W. Cusick , Yuan Li , Pantelimon Stanica

We present lower bounds on the sum and product of the distinct prime factors of an odd perfect number, which provide a lower bound on the size of the odd perfect number as a function of the number of its distinct prime factors.

Number Theory · Mathematics 2010-08-09 Anirudh Prabhu

We bound from below the number of shifted primes p+s<x that have a divisor in a given interval (y,z]. Kevin Ford has obtained upper bounds of the expected order of magnitude on this quantity as well as lower bounds in a special case of the…

Number Theory · Mathematics 2011-01-11 Dimitris Koukoulopoulos

In this paper we present some observations about the well-known Goldbach conjecture. In particular we list and interpret some numerical results which allow us to formulate a relation between prime numbers and even integers. We can also…

Number Theory · Mathematics 2013-10-01 Fausto Martelli

The exact lower bound on the probability of the occurrence of exactly one of $n$ random events each of probability $p$ is obtained.

Probability · Mathematics 2021-02-11 Iosif Pinelis

The distribution of prime numbers is here considered. We show a formula for $li^{-1}$ and we study the $\pi(x)$ function and Riemann's hypothesis.

Number Theory · Mathematics 2007-05-23 A. Balan

We prove lower bounds for the number of primes $p \leq N + b$ such that $p-b$ is divisible by $2^{k(N)}$ and has at most $k$ odd prime factors ($k \geq 2$), assuming $2^{k(N)} \leq N^\theta$ for some $\theta > 0$ depending on $k$. The proof…

Number Theory · Mathematics 2025-05-14 Likun Xie

Assuming the Generalized Riemann Hypothesis, we obtain a lower bound within a constant factor of the conjectured asymptotic result for the second moment for primes in an individual arithmetic progression in short intervals. Previous results…

Number Theory · Mathematics 2015-06-26 Daniel Goldston , C. Y. Yildirim

Recently, Agievich proposed an interesting upper bound on binomial coefficients in the de Moivre-Laplace form. In this article, we show that the latter bound, in the specific case of a central binomial coefficient, is larger than the one…

Combinatorics · Mathematics 2024-08-01 Jean-Christophe Pain

It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…

Number Theory · Mathematics 2017-07-24 Acquaah Peter

In previous articles, we classified the characters associated to algebraic points on Shimura curves of $\Gamma_0(p)$-type, and over number fields in a certain large class we showed that there are at most elliptic points on such a Shimura…

Number Theory · Mathematics 2013-01-01 Keisuke Arai

We extend the refined version of the Chabauty-Coleman bound on the number of rational points on a curve of genus g>1 to the case of bad reduction.

Number Theory · Mathematics 2010-03-30 David Brown

We present effective upper bounds on the symmetric bilinear complexity of multiplication in extensions of a base finite field Fp2 of prime square order, obtained by combining estimates on gaps between prime numbers together with an optimal…

Number Theory · Mathematics 2018-01-04 Hugues Randriam

In this paper, we will show that the $p$-adic valuation (where $p$ is a given prime number) of some type of rational numbers is unusually large. This generalizes the very recent results by the author and by A. Dubickas, which are both…

Number Theory · Mathematics 2022-12-02 Bakir Farhi
‹ Prev 1 3 4 5 6 7 10 Next ›