中文
相关论文

相关论文: Gaps of Smallest Possible Order between Primes in …

200 篇论文

For a polynomial $g(x)$ of deg $k \geq 2$ with integer coefficients and positive integer leading coefficient, we prove an upper bound for the least prime $p$ such that $g(p)$ is in non-homogeneous Beatty sequence $\lbrace \lfloor \alpha…

数论 · 数学 2019-12-03 C. G. Karthick Babu

Let $ \lfloor {x} \rfloor $ denote the greatest integer less than or equal to a real number $x$. Given real numbers $0<\alpha_1 < \alpha_2 < \cdots< \alpha_k < 1$ satisfying a certain condition, we show that there are infinitely many…

数论 · 数学 2025-12-23 Anup B. Dixit , Nikhil S Kumar

The Brun-Titchmarsh theorem shows that the number of primes $\le x$ which are congruent to $a\pmod{q}$ is $\le (C+o(1))x/(\phi(q)\log{x})$ for some value $C$ depending on $\log{x}/\log{q}$. Different authors have provided different…

数论 · 数学 2012-05-22 J. Maynard

We show that for real numbers $p,\,q$ with $q<p$, and the related power means $\mathscr{P}_p$, $\mathscr{P}_q$, the inequality $$\frac{\mathscr{P}_p(x)}{\mathscr{P}_q(x)} \le \exp \bigg( \frac{p-q}8 \cdot \bigg(\ln\bigg(\frac{\max x}{\min…

经典分析与常微分方程 · 数学 2019-10-16 Zsolt Páles , Paweł Pasteczka

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…

数论 · 数学 2007-05-23 D. A. Goldston , C. Y. Yildirim

Let $p$ be a prime and let $g(p)$ be the least primitive root modulo $p$. We prove that for any $\epsilon>0$ and $p$ large enough the bound \begin{align} g(p)\ll p^{\frac{1}{4\sqrt{e}}+\epsilon} \nonumber \end{align} holds for most prime…

数论 · 数学 2018-01-23 Andrea Sartori

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

This paper deals with the distribution of $\alpha \zeta^{n} \bmod 1$, where $\alpha\neq 0,\zeta>1$ are fixed real numbers and $n$ runs through the positive integers. Denote by $\Vert.\Vert$ the distance to the nearest integer. We…

数论 · 数学 2017-06-16 Johannes Schleischitz

In this paper, we prove that for any fixed $205/243<\gamma\leqslant1$, every sufficiently large $N$ satisfying $N\equiv 5 \pmod {24}$ can be represented as five squares of primes with one prime in $\mathcal{P}_\gamma$, which improves the…

数论 · 数学 2017-07-18 Jinjiang Li , Min Zhang

We study the number $p(n,t)$ of partitions of $n$ with difference $t$ between largest and smallest parts. Our main result is an explicit formula for the generating function $P_t(q) := \sum_{n \ge 1} p(n,t) \, q^n$. Somewhat surprisingly,…

数论 · 数学 2016-05-10 George E. Andrews , Matthias Beck , Neville Robbins

Under the assumption of infinitely many Siegel zeroes $s$ with $Re(s)>1-\frac{1}{(\log q)^{R}}$ for a sufficiently large value of $R$, we prove that there exist infinitely many $m$-tuples of primes that are $\ll e^{1.9828m}$ apart. This…

数论 · 数学 2024-03-06 Thomas Wright

Let $P$ be the set of all prime numbers, ${q_1},{q_2}, \cdots ,{q_m} \in P$, $P_k$ be the k-th $(k = 1,2, \cdots m)$ element of $P$ in ascending order of size, ${\alpha _1},{\alpha _2}, \cdots ,{\alpha _m}$ be positive integers, and ${\beta…

综合数学 · 数学 2018-04-27 Yuyang Zhu

Let $E$ be an elliptic curve of rank $\text{rk}(E) \geq 1$, and let $E(\mathbb{F}_p)$ be the elliptic group of order $\#E(\mathbb{F}_p)=n$. The number of primes $p\leq x$ such that $n$ is prime is expected to be $\pi(x,E)=\delta(E)x/\log^2…

综合数学 · 数学 2019-03-06 N. A. Carella

The recent technique for estimating lower bounds of the prime counting function $\pi(x)=#\{p \leq x: p\text{ prime}\}$ by means of the irrationality measures $\mu(\zeta(s)) \geq 2$ of special values of the zeta function claims that $\pi(x)…

综合数学 · 数学 2019-11-28 N. A. Carella

Let $q=p^\alpha$ be a fixed prime power, $k\geq 2$ be an integer. We give a new upper bound for the size of $k$-wise $q$-modular $L$-avoiding $L$-intersecting set systems, where $L$ is any proper subset of $\{0, \ldots , q-1\}$. Our proof…

组合数学 · 数学 2025-01-07 Gábor Hegedüs

We establish the existence of infinitely many \emph{polynomial} progressions in the primes; more precisely, given any integer-valued polynomials $P_1, >..., P_k \in \Z[\m]$ in one unknown $\m$ with $P_1(0) = ... = P_k(0) = 0$ and any $\eps…

数论 · 数学 2013-03-01 Terence Tao , Tamar Ziegler

We provide explicit upper bounds of the order $\log t/\log\log t$ for $|\zeta'(s)/\zeta(s)|$ and $|1/\zeta(s)|$ when $\sigma$ is close to $1$. These improve existing bounds for $\zeta(s)$ on the $1$-line.

数论 · 数学 2024-06-27 Michaela Cully-Hugill , Nicol Leong

We prove that a positive proportion of the intervals of any fixed scalar multiple of $\log(X)$ in the dyadic interval $[X,2X]$ contain a prime number. We also show that a positive proportion of the congruence classes modulo $q$ contain a…

数论 · 数学 2018-02-26 Naser T. Sardari

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…

数论 · 数学 2019-02-06 Nathan McNew

Let $V(T)$ denote the number of sign changes in $\psi(x) - x$ for $x\in[1, T]$. We show that $\liminf_{\;T\rightarrow\infty} V(T)/\log T \geq \gamma_{1}/\pi + 1.867\cdot 10^{-30}$, where $\gamma_{1} = 14.13\ldots$ denotes the ordinate of…

数论 · 数学 2019-11-07 Thomas Morrill , Dave Platt , Tim Trudgian
‹ 上一页 1 8 9 10 下一页 ›