中文
相关论文

相关论文: Chebyshev's conjecture and the prime number race

200 篇论文

We pose 100 new conjectures on representations involving primes or related things, which might interest number theorists and stimulate further research. Below are five typical examples: (i) For any positive integer $n$, there exists…

数论 · 数学 2017-12-04 Zhi-Wei Sun

We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…

数论 · 数学 2024-09-10 Jon Grantham , Andrew Granville

We resolve a function field version of two conjectures concerning the variance of the number of primes in short intervals (Goldston and Montgomery) and in arithmetic progressions (Hooley). A crucial ingredient in our work are recent…

数论 · 数学 2012-07-18 J. P. Keating , Z. Rudnick

The function $\epsilon(x)=\mbox{li}(x)-\pi(x)$ is known to be positive up to the (very large) Skewes' number. Besides, according to Robin's work, the functions $\epsilon_{\theta}(x)=\mbox{li}[\theta(x)]-\pi(x)$ and…

数论 · 数学 2013-03-19 Michel Planat , Patrick Solé

A study of certain Hamiltonian systems has lead Y. Long to conjecture the existence of infinitely many primes of the form $p=2[\alpha n]+1$, where $1<\alpha<2$ is a fixed irrational number. An argument of P. Ribenboim coupled with classical…

数论 · 数学 2007-08-09 William D. Banks , Igor E. Shparlinski

The convex hull of the subgraph of the prime counting function $x\rightarrow \pi(x)$ is a convex set, bounded from above by a graph of some piecewise affine function $x\rightarrow \epsilon(x)$. The vertices of this function form an infinite…

数论 · 数学 2014-08-18 Edward Tutaj

This work proposes a proof of the simplest cubic primes counting problem. It shows that the subset of primes {p = n^3 + 2 is prime : n => 1} is an infinite subset of primes. Further, the expected order of magnitude of the cubic primes…

综合数学 · 数学 2013-02-20 N. A. Carella

We present some new ideas on important problems related to primes. The topics of our discussion are: simple formulae for primes, twin primes, Sophie Germain primes, prime tuples less than or equal to a predefined number, and their…

综合数学 · 数学 2015-11-24 Dhananjay P. Mehendale

In this paper, we consider pairs of a prime and a prime power with a fixed difference. We prove an average result on the distribution of such pairs. This is a partial improvement of the result of Bauer (1998).

数论 · 数学 2016-10-31 Yuta Suzuki

Let $p_n$ be $n$th prime, and let $(S_n)_{n=1}^\infty:=(S_n)$ be the sequence of the sums of the first $2n$ consecutive primes, that is, $S_n=\sum_{k=1}^{2n}p_k$ with $n=1,2,\ldots$. Heuristic arguments supported by the corresponding…

数论 · 数学 2018-04-13 Romeo Meštrović

We propose new conjectures about the relationship between the principal blocks of finite groups for different primes and establish evidence for these conjectures.

群论 · 数学 2022-04-08 Gabriel Navarro , Noelia Rizo , A. A. Schaeffer Fry

Based on new explicit estimates for the prime counting function, we improve the currently known estimates for the particular sequence $C_n = np_n - \sum_{k \leq n}p_k$, $n \geq 1$, involving the prime numbers.

数论 · 数学 2017-06-14 Christian Axler

We formulate, using heuristic reasoning, precise conjectures for the range of the number of primes in intervals of length $y$ around $x$, where $y\ll (\log x)^2$. In particular we conjecture that the maximum grows surprisingly slowly as $y$…

数论 · 数学 2021-05-05 Andrew Granville , Allysa Lumley

We report on recent progress concerning the relationship that exists between the algebraic structure of a finite group and certain features of its class-size prime graph.

群论 · 数学 2024-10-02 Víctor Sotomayor

Numerical study of the distribution of the Riemann zeros differences following the work [1] shows the significance of the function for which the prime sum expression is proposed. Computational results related to this definition explored…

数论 · 数学 2014-02-06 Yuri Bachilov

The set of prime numbers has been analyzed, based on their algebraic and arithmetical structure. Here by obtaining a sort of linear formula for the set of prime numbers, they are redefined and identified; under a systematic procedure it has…

综合数学 · 数学 2014-12-30 Ramin Zahedi

We confirm Chebyshev's observation that primes are strikingly more abundant in non-square residue classes modulo a fixed integer under the Generalized Riemann Hypothesis (GRH) by proving a (natural) density $1$ statement for prime counting…

数论 · 数学 2026-01-06 Mounir Hayani

We provide a formula for the logarithmic density of the set of positive real numbers on which two prime counting functions $\psi(x;q,a)$ and $\psi(x;q,b)$ are simultaneously larger than their asymptotic main terms, as well as a method for…

数论 · 数学 2025-10-08 Kübra Benli , Greg Martin , Paul Péringuey

Fix a prime $p >2$ and a finite field $\mathbb{F}_{q}$ with $q$ elements, where $q$ is a power of $p$. Let $m$ be a monic polynomial in the polynomial ring $\mathbb{F}_{q}[T]$ such that $deg(m)$ is large. Fix an integer $r\geq 2$, and let…

数论 · 数学 2021-10-15 Youssef Sedrati

One aspect of Chebyshev's bias is the phenomenon that a prime number, $ q $, modulo another prime number, $ p$, experimentally seems to be slightly more likely to be a nonquadratic residue than a quadratic residue. We thought it would be…

数论 · 数学 2016-09-06 Daniel Hutama