中文
相关论文

相关论文: On the Gaps between Two Consecutive Prime Numbers

200 篇论文

A positive integer is called an $E_j$-number if it is the product of $j$ distinct primes. We prove that there are infinitely many triples of $E_2$-numbers within a gap size of $32$ and infinitely many triples of $E_3$-numbers within a gap…

数论 · 数学 2021-03-16 Daniel A. Goldston , Apoorva Panidapu , Jordan Schettler

Question 10208b (1992) of the American Mathematical Monthly asked: does there exist an increasing sequence $\{a_k\}$ of positive integers and a constant $B > 0$ having the property that $\{ a_k + n\}$ contains no more than $B$ primes for…

数论 · 数学 2016-04-26 Christian Elsholtz

We state a general formula for the number of binomial coefficients $n$ choose $k$ that are divided by a fixed power of a prime $p$, i.e., the number of binomial coefficients divided by $p^j$ and not divided by $p^{j+1}$.

综合数学 · 数学 2008-03-10 William B. Everett

A geometric-arithmetic progression of primes is a set of $k$ primes (denoted by GAP-$k$) of the form $p_1 r^j + j d$ for fixed $p_1$, $r$ and $d$ and consecutive $j$, {\it i.e}, $\{p_1, \, p_1 r + d, \, p_1 r^2 + 2 d, \, p_1 r^3 + 3 d,…

数论 · 数学 2017-02-15 Sameen Ahmed Khan

In this paper we establish function field versions of two classical conjectures on prime numbers. The first says that the number of primes in intervals (x,x+x^epsilon] is about x^epsilon/log x and the second says that the number of primes…

数论 · 数学 2015-11-03 Efrat Bank , Lior Bary-Soroker , Lior Rosenzweig

We consider the problem of finding small prime gaps in various sets of integers $\mathcal{C}$. Following the work of Goldston-Pintz-Yildirim, we will consider collections of natural numbers that are well-controlled in arithmetic…

数论 · 数学 2014-05-15 Jacques Benatar

We prove that $d_k(n)=d_k(n+B)$ infinitely often for any positive integers $k$ and $B$, where $d_k(n)$ denotes the number of divisors of $n$ coprime to $k$.

数论 · 数学 2022-10-18 Qi-Yang Zheng

Consider the set of all natural numbers that are co-prime to primes less than or equal to a given prime. Then given a consecutive pair of numbers in that set with an arbitrary even gap, we prove there exists an unbounded number of actual…

综合数学 · 数学 2021-11-18 John K Sellers

In this paper we study the problem of detecting prime numbers between all consecutive cubes. Firstly, we use a large computation to show that there is always a prime between $n^3$ and $(n+1)^3$ for $n^3\leq 1.649\cdot 10^{40}$. In addition,…

Cyclotomic polynomials play fundamental roles in number theory, combinatorics, algebra and their applications. Hence their properties have been extensively investigated. In this paper, we study the maximum gap $g$ (maximum of the…

数论 · 数学 2020-01-24 Ala'a Al-Kateeb , Mary Ambrosino , Hoon Hong , Eunjeong Lee

In the present work we prove a number of surprising results about gaps between consecutive primes and arithmetic progressions in the sequence of generalized twin primes which could not have been proven without the recent fantastic…

数论 · 数学 2013-05-28 Janos Pintz

Suppose $a^2 (a^2 + 1)$ divides $b^2 (b^2 + 1)$ with $b > a$. In this paper, we improve a previous result and prove a gap principle, without any additional assumptions, namely $b \gg a (\log a)^{1/8} / (\log \log a)^{12}$. We also obtain $b…

数论 · 数学 2019-06-27 Tsz Ho Chan

This article studies the number of ways of selecting $k$ objects arranged in $p$ circles of sizes $n_1,\ldots,n_p$ such that no two selected ones have less than $s$ objects between them. If $n_i\geq sk+1$ for all $1\leq i \leq p$, this…

组合数学 · 数学 2018-05-07 Emiliano J. J. Estrugo , Adrián Pastine

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…

综合数学 · 数学 2015-08-11 Jens Oehlschlägel

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…

数论 · 数学 2013-10-01 Fausto Martelli

We show that if {1, b, c, d} is a D(-1) diophantine quadruple with b<c<d and c=1+s^2, then the cases s=p^k, s=2p^k, c=p and c=2p^k do not occur, where p is an odd prime and k is a positive integer. For the integer d=1+x^2, we show that it…

数论 · 数学 2013-09-18 Anitha Srinivasan

The idea of generating prime numbers through sequence of sets of co-primes was the starting point of this paper that ends up by proving two conjectures, the existence of infinitely many twin primes and the Goldbach conjecture. The main idea…

综合数学 · 数学 2016-09-19 Samir Brahim Belhaouari

Let $k$ be an integer which is the difference between prime numbers infinitely often. It is known that there are infinitely many such $k$ and, in this paper, we give a new unconditional proof that these $k$ have positive density and improve…

数论 · 数学 2015-01-28 Stijn S. C. Hanson

The second author studied arithmetic properties of a class of sequences that generalize the sequence of derangements. The aim of the following paper is to disprove two conjectures stated in \cite{miska}. The first conjecture regards the set…

数论 · 数学 2020-04-24 Eryk Lipka , Piotr Miska

We study pairs of consecutive odd numbers through a straightforward indexing. We focus in particular on twin primes and their distribution. With a counting argument, we calculate the limit of an alternating sum that is equal to 1 which…

综合数学 · 数学 2021-06-08 Marc Wolf , FranÇOis Wolf , FranÇOis-Xavier Villemin