中文
相关论文

相关论文: Nonuniform Distributions of Residues of Prime Sequ…

200 篇论文

Given a zero-free region and an averaged zero-density estimate over all Dirichlet $L$-functions modulo $q\in\mathbb{N}$, we refine the error terms of the prime number theorem in all and almost all short arithmetic progressions. For example,…

数论 · 数学 2026-05-20 Michael Harm

In a recent advance towards the Prime $k$-tuple Conjecture, Maynard and Tao have shown that if $k$ is sufficiently large in terms of $m$, then for an admissible $k$-tuple $\mathcal{H}(x) = \{gx + h_j\}_{j=1}^k$ of linear forms in…

We report a rigorous theory to show the origin of the unexpected periodic behavior seen in the consecutive differences between prime numbers. We also check numerically our findings to ensure that they hold for finite sequences of primes,…

统计力学 · 物理学 2007-05-23 Saul Ares , Mario Castro

For a fixed rational number g, not equal to -1,0 or 1 and integers a and d we consider the set of primes p for which the order of g(mod p) is congruent to a(mod d). For d=4 and d=3 it is shown that, under the Generalized Riemann Hypothesis,…

数论 · 数学 2016-09-07 Pieter Moree

Let $g_1, \dots , g_M$ be additive functions for which there exist nonconstant polynomials $G_1, \dots , G_M$ satisfying $g_i(p) = G_i(p)$ for all primes $p$ and all $i \in \{1, \dots , M\}$. Under fairly general and nearly optimal…

数论 · 数学 2024-01-03 Akash Singha Roy

Let $p_1 = 2, p_2 = 3,...$ be the sequence of all primes. Let $\epsilon$ be an arbitrarily small but fixed positive number, and fix a coprime pair of integers $q \ge 3$ and $a$. We will establish a lower bound for the number of primes…

数论 · 数学 2011-11-01 Tristan Freiberg

Let $q$ be a fixed odd prime. We show that a finite subset $B$ of integers, not containing any perfect $q^{th}$ power, contains a $q^{th}$ power modulo almost every prime if and only if $B$ corresponds to a blocking set (with respect to…

数论 · 数学 2025-07-11 Bhawesh Mishra , Paolo Santonastaso

A classical result in number theory is Dirichlet's theorem on the density of primes in an arithmetic progression. We prove a similar result for numbers with exactly k prime factors for k>1. Building upon a proof by E.M. Wright in 1954, we…

数论 · 数学 2016-05-03 Neha Prabhu

We prove that the set of Farey fractions of order $T$, that is, the set $\{\alpha/\beta \in \Q : \gcd(\alpha, \beta) = 1, 1 \le \alpha, \beta \le T\}$, is uniformly distributed in residue classes modulo a prime $p$ provided $T \ge p^{1/2…

数论 · 数学 2007-05-29 A. C. Cojocaru , I. E. Shparlinski

We use the Burgess bound and combinatorial sieve to obtain an upper bound on the number of primes $p$ in a dyadic interval $[Q,2Q]$ for which a given interval $[u+1,u+\psi(Q)]$ does not contain a quadratic non-residue modulo $p$. The bound…

数论 · 数学 2013-11-28 Sergei V. Konyagin , Igor E. Shparlinski

Let s_q(n) denote the base q sum of digits function, which for n<x, is centered around (q-1)/2 log_q x. In Drmota, Mauduit and Rivat's 2009 paper, they look at sum of digits of prime numbers, and provide asymptotics for the size of the set…

数论 · 数学 2023-03-13 Eric Naslund

We show how to construct discretely ordered principal ideal subrings of $\mathbb Q[x]$ with various types of prime behaviour. Given any set $\mathcal D$ consisting of finite strictly increasing sequences $(d_1,d_2,\dots, d_l)$ of positive…

数论 · 数学 2022-11-24 Jana Glivická , Ester Sgallová , Jan Šaroch

We show that for any $\varepsilon > 0$, prime $q$ sufficiently large with respect to $1 / \varepsilon$ and residue class $(a,q) = 1$, there exist two integers $m, n \leq q^{5/2 + \varepsilon}$ with $m \equiv n \equiv a \pmod{q}$ such that…

数论 · 数学 2026-05-06 Kevin Ford , Maksym Radziwiłł

We study the distribution of consecutive sums of two squares in arithmetic progressions. If $\{E_n\}_{n \in \mathbb{N}}$ is the sequence of sums of two squares in increasing order, we show that for any modulus $q$ and any congruence classes…

数论 · 数学 2024-11-26 Noam Kimmel , Vivian Kuperberg

In this note, we compute the probability that a $k\times n$ matrix can be extended to an $n\times n$ invertible matrix over $\F_q[x]$, which turns out to be $(1-q^{k-n})(1-q^{k-1-n})...(1-q^{1-n})$. Connections with Dirichlet's density…

概率论 · 数学 2013-01-17 Xiangqian Guo , Guangyu Yang

New exceptional (i.e. non-repeating) prime number multiplets are given and formulated in terms of arithmetic progressions, along with laws governing them. Accompanying repeating prime number multiplets are pointed out. Prime number…

数论 · 数学 2011-05-23 H. J. Weber

The chronicle of prime numbers travel back thousands of years in human history. Not only the traits of prime numbers have surprised people, but also all those endeavors made for ages to find a pattern in the appearance of prime numbers has…

综合数学 · 数学 2022-09-27 Tashreef Muhammad , G. M. Shahariar , Tahsin Aziz , Mohammad Shafiul Alam

In a recent work Friedlander studied the problem of how large consecutive prime gaps should be in order that the sum of the reciprocals should be divergent. Supposing a very deep Hypothesis, a generalization of the Hardy--Littlewood prime…

数论 · 数学 2025-05-13 Akos Magyar , Janos Pintz

There are two basic number sequences which play a major role in the prime number distribution. The first Number Sequence SQ1 contains all prime numbers of the form 6n+5 and the second Number Sequence SQ2 contains all prime numbers of the…

综合数学 · 数学 2008-01-29 Harry K. Hahn

In this paper, we consider the distribution of the continuous paths of Dirichlet character sums modulo prime $q$ on the complex plane. We also find a limiting distribution as $q \rightarrow \infty$ using Steinhaus random multiplicative…

数论 · 数学 2021-07-07 Ayesha Hussain