C. S. Franze
We prove that there are infinitely many integers $n$ such that the total number of prime factors of $(n+h_{1})(n+h_{2})...(n+h_κ)$ is at most $(1/2)κ\logκ+O(κ)$, provided $κ$ is sufficiently large.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We conjecture average counting functions for prime $k$-tuples based on a gamma distribution hypothesis for prime powers. The conjecture is closely related to the Hardy-Littlewood conjecture for $k$-tuples but yields better estimates. Possessing average counting functions along with their corresponding exact counting functions allows to implicitly define pertinent $k$-tuple zeta functions. The $k$-tuple zeta functions in turn allow construction of $k$-tuple analogs of explicit formulae. If the zeros of the (implicitly defined) $k$-tuple zeta can be determined, the explicit formulae should yield…
Exact summatory functions that count the number of prime $k$-tuples up to some cut-off integer are presented. Related $k$-tuple analogs of the first and second Chebyshev functions are then defined.
Exact summatory functions that count the number of prime $k$-tuples up to some cut-off integer are presented. Related summatory $k$-tuple analogs of the first and second Chebyshev functions are then defined. Using a gamma distribution hypothesis for prime powers, associated average summatory functions are conjectured. With exact and average summatory functions in hand, pertinent $k$-tuple zeta functions can be identified, and Perron's formula allows the formulation of $k$-tuple analogs of explicit formulae. The $k$-tuple zeta functions are then used to make some inferences about $k$-tuple prim…
We show that a positive proportion of all gaps between consecutive primes are small gaps. We provide several quantitative results, some unconditional and some conditional, in this flavour.
Let $D_{k}$ be a set with $k$ distinct elements of integers such that $d_{1}<d_{2}<\cdots<d_{k}$. We say $D_{k}^{*}$ is a $k$-tuple prime difference champion ($k$-tuple PDC) for primes $\le x$ if the set $D_{k}^{*}$ is the most probable differences among $k+1$ primes up to $x$. Unconditionally we prove that the $k$-tuple PDCs go to infinity and further have asymptotically the same number prime factors when weighted by logarithmic derivative as the porimorials. Assuming an appropriate form of the Hardy-Littlewood Prime $k$-tuple Conjecture, we obtain that the $k$-tuple PDCs are infinite square-…
Starting with Zhang's theorem on the infinitude of prime doubles, we give an inductive argument that there exists an infinite number of prime $k$-tuples for at least one admissible set $\mathcal{H}_k=\{h_1,\ldots,h_k\}$ for each $k$.
Primes in tuples and Romanoff's theorem
本文研究了元组中素数数量的下界问题，并以此为应用，给出了Romanoff型表示函数的下界。
For a fixed integer $r\ge1$, we say $k$-tuple integers $(x_1,\ldots,x_k)$ are relatively $r$-prime if there exists no prime $p$ such that all $k$ integers is multiple of $p^r$. Benkoski proved that the number of relatively $r$-prime $k$-tuple integers in $[1,x]^k$ is $x^k/ζ(rk)+$(Error term). We showed that the exact order of error term is $x^{k-1}$ for $rk\ge3$ and $k\not=1$.
In 1922 Hardy and Littlewood proposed a conjecture on the asymptotic density of admissible prime k-tuples. In 2011 Wolf computed the "Skewes number" for twin primes, i.e., the first prime at which a reversal of the Hardy-Littlewood inequality occurs. In this paper, we find "Skewes numbers" for 8 more prime k-tuples and provide numerical data in support of the Hardy-Littlewood conjecture. Moreover, we present several algorithms to compute such numbers.
We prove that there are infinitely often pairs of primes much closer than the average spacing between primes - almost within the square root of the average spacing. We actually prove a more general result concerning the set of values taken on by the differences between primes.
The irrationality of a prime factor series under a prime tuples conjecture
本文在素数 $k$-tuples 猜想下证明了级数 $\sum_{n=1}^\infty \frac{ω(n)}{2^n}$ 是无理数，有条件地解决了 Erdős 提出的一个问题。
Assuming Dickson's conjecture, we obtain multidimensional analogues of recent results on the behavior of certain multiplicative arithmetic functions near twin-prime arguments. This is inspired by analogous unconditional theorems of Schinzel undertaken without primality assumptions.
Explicit bounds for prime K-tuplets
本文运用大筛法，建立满足给定线性表达式同时为素数条件的素数 $k$ 元组计数的显式上界。
Primes in Tuples of Linear Forms in Number Fields and Function Fields
本文将 Maynard-Tao 定理推广至数域与函数域中任意首项系数的线性形式可容许元组，并给出若干应用。
Let $L_1$, $L_2$ $L_3$ be integer linear functions with no fixed prime divisor. We show there are infinitely many $n$ for which the product $L_1(n)L_2(n)L_3(n)$ has at most 7 prime factors, improving a result of Porter. We do this by means of a weighted sieve based upon the Diamond-Halberstam-Richert multidimensional sieve.
In order to consider j-wise relative r-primality conditions that do not necessarily require all j-tuples of elements in a Dedekind domain to be relatively r-prime, we define the notion of j-wise relative r-primality with respect to a fixed j-uniform hypergraph H. This allows us to provide further generalisations to several results on natural densities not only for a ring of algebraic integers, but also for the ring F_q[x].
Let $r\ge k\ge 2$ be fixed positive integers. Let $\varrho_{r,k}$ denote the characteristic function of the set of $r$-tuples of positive integers with $k$-wise relatively prime components, that is any $k$ of them are relatively prime. We use the convolution method to establish an asymptotic formula for the sum $\sum_{n_1,\ldots,n_r\le x} \varrho_{r,k}(n_1,\ldots,n_r)$ by elementary arguments. Our result improves the error term obtained by J. Hu (2013).
We studied two probabilistic models of the distribution of primes in the natural number [1].The paper considers the third probabilistic model of the distribution of primes in the natural number. The author proved that the results obtained by considering three probabilistic models are similar. It is shown that the accuracy of these probabilistic models exceeds the Riemann hypothesis with a certain probability. The author constructed probabilistic models for the analysis of the average distance between neighboring prime numbers and k-tuples and found probability distributions of these random var…
We find an upper bound for the sum $\sum_{x<n\leq 2x}\textbf{1}_{\mathbb{P}}(n+h_{i_{1}})\cdots\textbf{1}_{\mathbb{P}}(n+h_{i_{m+1}})w_{n}$, where $(h_{i_{1}},...,h_{i_{m+1}})$ is any $(m+1)$-tuple of elements in the admissible set $\mathcal{H}=\{h_{1},...,h_{k}\}$, $m\geq 1$ and $x$ is sufficiently large, with the same weights $w_{n}$ used in the Maynard's paper "Dense clusters of primes in subsets". The estimate will be uniform over positive integer $k$ with $m+1\leq k\leq (\log x)^{1/5}$ and on admissible set $\mathcal{H}$ with $0\leq h_{1}<...<h_{k}\leq x$. The upper bound will depend on a…
We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that there are infinitely often primes differing by 16 or less. Even a much weaker conjecture implies that there are infinitely often primes a bounded distance apart. Unconditionally, we prove that there exist consecutive primes which are closer than any arbitrarily small multiple of the average spacing, that is, \[ \liminf_{n\to \infty} \frac{p_{n+1}-p_n}{\log p…
Let $k\ge 2$ and $Π(n)=\prod_{i=1}^k(a_in+b_i)$ for some integers $a_i, b_i$ ($1\le i\le k$). Suppose that $Π(n)$ has no fixed prime divisors. Weighted sieves have shown for infinitely many integers $n$ that $Ω(Π(n))\le r_k$ holds for some integer $r_k$ which is asymptotic to $k\log{k}$. We use a new kind of weighted sieve to improve the possible values of $r_k$ when $k\ge 4$.
In the present work a new simple proof of the theorem of Gallagher about the average of the singular series in the Hardy-Littlewood prime k-tuple conjecture is proved (in an even stronger form) which is uniform with respect to k (if the length of the interval $H$ is sufficiently large as a function of $k$). This result of Gallagher played a key role in our original joint work with D. A. Goldston and C. Y. Yildirim, where we showed the existence of infinitely many small gaps between consecutive primes. In the present work some weaker variants of Gallagher`s result are also proved (in an even ea…
For any real $x$ and any integer $k\ge1$, we say that a set $\mathcal{D}_{k}$ of $k$ distinct integers is a $k$-tuple jumping champion if it is the most common differences that occurs among $k+1$ consecutive primes less than or equal to $x$. For $k=1$, it's known as the jumping champion introduced by J. H. Conway. In 1999 A. Odlyzko, M. Rubinstein, and M. Wolf announced the Jumping Champion Conjecture that the jumping champions greater than 1 are 4 and the primorials 2, 6, 30, 210, 2310,.... They also made a weaker and possibly more accessible conjecture that any fixed prime $p$ divides all su…
We prove several Ramanujan-type congruences modulo powers of $5$ for partition $k$-tuples with $5$-cores, for $k=2, 3, 4$. We also prove some new infinite families of congruences modulo powers of primes for $k$-tuples with $p$-cores, where $p$ is a prime.
The convergence of an alternating series of Erdős, assuming the Hardy--Littlewood prime tuples conjecture
本文针对Erdős提出的某交错级数收敛性的公开问题，结合素数随机筛选模型与Gallagher计算变体，在强版本Hardy–Littlewood素数元组猜想下证明了该级数条件收敛。
Prime-power Diophantine tuples
该研究将丢番图数组的间隙论证推广到素数幂情形，得到正约化 $D(\pm p^r)$ 数组的基数一致上界，明确了不同素数幂下的基数界限及最大基数的阶性质。
Let $k\geq 2$ and $\mathcal{P} (n) = (A_1 n + B_1 ) \cdots (A_k n + B_k)$ where all the $A_i, B_i$ are integers. Suppose that $\mathcal{P} (n)$ has no fixed prime divisors. For each choice of $k$ it is known that there exists an integer $\varrho_k$ such that $\mathcal{P} (n)$ has at most $\varrho_k$ prime factors infinitely often. We used a new weighted sieve set-up combined with a device called an $\varepsilon$-trick to improve the possible values of $\varrho_k$ for $k\geq 7$. As a by-product of our approach, we improve the conditional possible values of $\varrho_k$ for $k\geq 4$, assuming th…
We introduce a refinement of the GPY sieve method for studying prime $k$-tuples and small gaps between primes. This refinement avoids previous limitations of the method, and allows us to show that for each $k$, the prime $k$-tuples conjecture holds for a positive proportion of admissible $k$-tuples. In particular, $\liminf_{n}(p_{n+m}-p_n)<\infty$ for any integer $m$. We also show that $\liminf(p_{n+1}-p_n)\le 600$, and, if we assume the Elliott-Halberstam conjecture, that $\liminf_n(p_{n+1}-p_n)\le 12$ and $\liminf_n (p_{n+2}-p_n)\le 600$.
Let $τ$ denote the divisor function and $\mathcal{H}=\{h_{1},...,h_{k}\}$ be an admissible set. We prove that there are infinitely many $n$ for which the product $\prod_{i=1}^{k}(n+h_{i})$ is square-free and $\sum_{i=1}^{k}τ(n+h_{i})\leq \lfloor ρ_{k}\rfloor$, where $ρ_{k}$ is asymptotic to $\frac{2126}{2853} k^{2}$. It improves a previous result of M. Ram Murty and A. Vatwani, replacing $2126/2853$ by $3/4$. The main ingredients in our proof are the higher rank Selberg sieve and Irving-Wu-Xi estimate for the divisor function in arithmetic progressions to smooth moduli.
Consecutive primes in tuples
本文研究了元组中连续素数的分布，证明了存在无限多个n使得H(n)包含至少m个连续素数，并构造了具有递增或递减间隙的素数字符串。
Prime Tuples and Siegel Zeros
本文在无穷多个近实轴 Siegel 零点假设下，证明素数 m 元组间距可降至 ≪e^{1.9828m}，并改进三至六元组间距上界。
We show by an inclusion-exclusion argument that the prime $k$-tuple conjecture of Hardy and Littlewood provides an asymptotic formula for the number of consecutive prime numbers which are a specified distance apart. This refines one aspect of a theorem of Gallagher that the prime $k$-tuple conjecture implies that the prime numbers are distributed in a Poisson distribution around their average spacing.
We prove the following function field analog of the Hardy-Littlewood conjecture (which generalizes the twin prime conjecture) over large finite fields. Let n,r be positive integers and q an odd prime power. For distinct polynomials a_1, ..., a_r over F_q of degree <n let π(q,n;a) be the number of monic polynomials f over F_q of degree n such that f+a_1, ..., f+a_r are simultaneously irreducible. We prove that π(q,n;a) asymptotically equals q^n/n^r as q tends to infinity on odd prime powers and n,r are fixed (the tuple a1,...,a_r need not be fixed).
Given a finite set of primes $S$ and a $m$-tuple $(a_1,\dots,a_m)$ of positive, distinct integers we call the $m$-tuple $S$-Diophantine, if for each $1\leq i < j\leq m$ the quantity $a_ia_j+1$ has prime divisors coming only from the set $S$. For a given set $S$ we give a practical algorithm to find all $S$-Diophantine quadruples, provided that $|S|=3$.
As a refinement of the celebrated recent work of Yitang Zhang we show that any admissible k-tuple of integers contains at least two primes and almost primes in each component infinitely often if k is at least 181000. This implies that there are infinitely many gaps between consecutive primes of size at most 2530338, with an improved admissible k-tuple of Andrew W. Sutherland to 2326476.
Under the prime-tuple hypothesis, the set of signed primes is a sumset.
Let $Λ\left(n\right)$ be the Von Mangoldt function, let \[ r_{G}\left(n\right)=\underset{{\scriptstyle m_{1}+m_{2}=n}}{\sum_{m_{1},m_{2}\leq n}}Λ\left(m_{1}\right)Λ\left(m_{2}\right), \] \[ r_{PT}\left(N,h\right)=\sum_{n=0}^{N}Λ\left(n\right)Λ\left(n+h\right),\,h\in\mathbb{N} \] be the counting function of the Goldbach numbers and the counting function of the prime tuples, respectively. Let $N>2$ be an integer. We will find the explicit formulae for the averages of $r_{G}\left(n\right)$ and $r_{PT}\left(N,h\right)$ in terms of elementary functions, the incomplete Beta function $B_{z}\left(a,b\…
Prime numbers have attracted the attention of mathematiciansand enthusiasts for millenniums due to their simple definition and remarkable properties. In this paper, we study primorial numbers (the product of the first prime numbers) to define primorial sets, primorial intervals, primorial tables, and primorial totative numbers. We establish relationships between prime numbers and primorial totative numbers and between admissible k-tuples of prime numbers and admissible k-tuples of primorial totative. Finally, we study the Goldbach conjecture and derive four Goldbach conjectures using primordia…
Combining the Hardy-Littlewood k-tuple conjecture with a heuristic application of extreme-value statistics, we propose a family of estimator formulas for predicting maximal gaps between prime k-tuples. Computations show that the estimator a(log(x/a)-b) satisfactorily predicts the maximal gaps below x, where a is the expected average gap between the same type of k-tuples, a=O(log^k x). Heuristics suggest that maximal gaps between prime k-tuples near x are approximately a*log(x/a), and thus have the order O(log^{k+1}x). The distribution of maximal gaps around the trend curve a*log(x/a) is close …
Let $q$ be a prime power. We estimate the number of tuples of degree bounded monic polynomials $(Q_1,\ldots,Q_v) \in (\mathbb{F}_q[z])^v$ that satisfy given pairwise coprimality conditions. We show how this generalises from monic polynomials in finite fields to Dedekind domains with finite norms.
For an integer $k\ge2$, a tuple of $k$ positive integers $(M_i)_{i=1}^{k}$ is called an amicable $k$-tuple if the equation \[ σ(M_1)=\cdots=σ(M_k)=M_1+\cdots+M_k \] holds. This is a generalization of amicable pairs. An amicable pair is a pair of distinct positive integers each of which is the sum of the proper divisors of the other. Gmelin (1917) conjectured that there is no relatively prime amicable pairs and Artjuhov (1975) and Borho (1974) proved that for any fixed positive integer $K$, there are only finitely many relatively prime amicable pairs $(M,N)$ with $ω(MN)=K$. Recently, Pollack (2…
On existence of generalised Lehmer numbers modulo primes
本文推广Lehmer数为模奇素数$q$的$q$-元组，计数并给出带显式误差项的渐近估计，利用特征和与Deligne界。
We discuss in some detail the general problem of computing averages of convergent Euler products, and apply this to examples arising from singular series for the $k$-tuple conjecture and more general problems of polynomial representation of primes. We show that the singular series for the $k$-tuple conjecture have a limiting distribution when taken over $k$-tuples with (distinct) entries of growing size, and observe that its moments have a curious symmetry property. We also give conditional arguments that would imply that the number of twin primes (or more general polynomial prime patterns) in…
We implement the Maynard-Tao method of detecting primes in tuples to investigate small gaps between primes in arithmetic progressions, with bounds that are uniform over a range of moduli.
We show that there exists a bounded pattern of m consecutive primes for any m>0, that means a tuple H_m of m distinct non-negative integers h_i (i=1,2,...m) such that its translations contain arbitrarily long (finite) arithmetic progressions. More precisely, the set of natural numbers n for which all components n+h_i (i=1,2,...m) are consecutive primes contains arbitrarily long (finite) arithmetic progressions. Moreover, the set of m-tuples that satisfy this property represents a positive proportion of all m-tuples. The present result is the generalization of the results of Green-Tao (about th…
We use short divisor sums to approximate prime tuples and moments for primes in short intervals. By connecting these results to classical moment problems we are able to prove that a positive proportion of consecutive primes are within a quarter of the average spacing between primes.
Instead of a strong quantitative form of the Hardy-Littlewood prime $k$-tuple conjecture, one can assume an average form of it and still obtains the same distribution result on $ψ(x+h) - ψ(x)$ by Montgomery and Soundararajan [1].
Counting $k$-tuples of positive integers such that the values of several polynomials of $k$ variables are relatively prime
本文针对满足一般性质的多项式系统，建立了关于其最大公因数函数的有界强乘性函数和的渐近公式，并由此推导出$k$元组互素密度的Ekedahl-Poonen公式的误差项版本。
In this paper, we define a $k$-Diophantine $m$-tuple to be a set of $m$ positive integers such that the product of any $k$ distinct positive integers is one less than a perfect square. We study these sets in finite fields $\mathbb{F}_p$ for odd prime $p$ and guarantee the existence of a $k$-Diophantine m-tuple provided $p$ is larger than some explicit lower bound. We also give a formula for the number of 3-Diophantine triples in $\mathbb{F}_p$ as well as an asymptotic formula for the number of $k$-Diophantine $k$-tuples.
Let $\mathcal{H}^{*}=\{h_1,h_2,\ldots\}$ be an ordered set of integers. We give sufficient conditions for the existence of increasing sequences of natural numbers $a_j$ and $n_k$ such that $n_k+h_{a_j}$ is a sum of two squares for every $k\geq 1$ and $1\leq j\leq k.$ Our method uses a novel modification of the Maynard-Tao sieve together with a second moment estimate. As a special case of our result, we deduce a conjecture due to D.~Jakobson which has several implications for quantum limits on flat tori.
Let $S$ denote a set of primes and let $a_1,\ldots,a_m$ be positive distinct integers. We call the $m$-tuple $(a_1,\ldots,a_m)$ an $S$-Diophantine tuple if $a_ia_j+1=s_{i,j}$ are $S$-integers for all $i\not=j$. In this paper, we show that no $S$-Diophantine quadruple (i.e~$m=4$) exists if $S=\{2,q\}$ with $q\equiv 3\; (\bmod\, 4)$ or $q<10^9$. For two arbitrary primes $p,q<10^5$ we gain the same result.
In this paper we establish a function field analogue of a conjecture in number theory which is a combination of several famous conjectures, including the Hardy-Littlewood prime tuple conjecture, conjectures on the number of primes in arithmetic progressions and in short intervals, and the Goldbach conjecture. We prove an asymptotic formula for the number of simultaneous prime values of $n$ linear functions, in the limit of a large finite field.
For a prime p, a Diophantine m-tuple in $\mathbb{F}_p$ is a set of m nonzero elements of $\mathbb{F}_p$ with the property that the product of any two of its distinct elements is one less than a square. In this paper, we present formulas for the number $N^{(m)}(p)$ of Diophantine m-tuples in $\mathbb{F}_p$ for m=2,3 and 4. Fourier coefficients of certain modular forms appear in the formula for the number of Diophantine quadruples. We prove that asymptotically $N^{(m)}(p)=\frac{1}{2^{m \choose 2 }}\frac{p^m}{m!} + o(p^m)$, and also show that if $p>2^{2m-2}m^2$, then there is at least one Diophan…
We use the circle method to evaluate the behavior of limit-periodic functions on primes. For those limit-periodic functions that satisfy a kind of Barban-Davenport-Halberstam condition and whose singular series converge fast enough, we can evaluate their average value on primes. As an application, this result is used to show how tuples of different k-free numbers behave when linear shifts are applied.
The Hardy--Littlewood prime $k$-tuples conjecture has long been thought to be completely unapproachable with current methods. While this sadly remains true, startling breakthroughs of Zhang, Maynard, and Tao have nevertheless made significant progress toward this problem. In this work, we extend the Maynard-Tao method to both number fields and the function field $\mathbb{F}_q(t)$.
In this paper we show that a polynomial equation admits infinitely many prime-tuple solutions assuming only that the equation satisfies suitable local conditions and the polynomial is sufficiently non-degenerate algebraically. Our notion of algebraic non-degeneracy is related to the $h$-invariant introduced by W. M. Schmidt. Our results prove a conjecture of B. Cook and Á. Magyar \cite{CM} for hypersurfaces of degrees $2$ and $3$.
Let $\mathfrak{p}=(\mathfrak{p}_1,...,\mathfrak{p}_r)$ be a system of $r$ polynomials with integer coefficients of degree $d$ in $n$ variables $\mathbf{x}=(x_1,...,x_n)$. For a given $r$-tuple of integers, say $\mathbf{s}$, a general local to global type statement is shown via classical Hardy-Littlewood type methods which provides sufficient conditions for the solubility of $\mathfrak{p}(\mathbf{x})=\mathbf{s}$ under the condition that each of the $x_i$'s is prime.
A number $n$ is practical if every integer in $[1,n]$ can be expressed as a subset sum of the positive divisors of $n$. We consider the distribution of practical numbers that are also shifted primes, improving a theorem of Guo and Weingartner. In addition, essentially proving a conjecture of Margenstern, we show that all large odd numbers are the sum of a prime and a practical number. We also consider an analogue of the prime $k$-tuples conjecture for practical numbers, proving the "correct" upper bound, and for pairs, improving on a lower bound of Melfi.
Fix coprime natural numbers $a,q$. Assuming the Prime $k$-tuple Conjecture, we show that there exist arbitrarily long arithmetic progressions of Carmichael numbers, each of which lies in the reduced residue class $a$ mod $q$ and is a product of three distinct prime numbers.
Let $η>0$ be a fixed positive number, let $N$ be a sufficiently large number. In this paper, we study the second moment of the sum of Hecke eigenvalues over primes in short intervals (whose length is $η\log N$) on average (with some weights) over the family of weight $k$ holomorphic Hecke cusp forms. We also generalize the above result to Hecke-Maass cusp forms for $SL(2,\mathbb{Z})$ and $SL(3,\mathbb{Z}).$ By applying the Hardy-Littlewood prime 2-tuples conjecture, we calculate the exact values of the mean values.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。