中文
相关论文

相关论文: Inequities in the Shanks-Renyi prime number race o…

200 篇论文

In this article, we investigate the statistical distribution and asymptotic behavior of the family of monic integer polynomials of degree $n$ having at least one root in a fixed number field $K$. Although the framework of thin sets implies…

数论 · 数学 2026-05-22 Amirali Fatehizadeh

It has been well-observed that an inequality of the type $\pi(x;q,a) > \pi(x;q,b)$ is more likely to hold if $a$ is a non-square modulo $q$ and $b$ is a square modulo $q$ (the so-called ``Chebyshev Bias''). For instance, each of…

数论 · 数学 2007-05-23 Greg Martin

For a fixed rational number g different from -1,0,1 and integers a and d the set N_g(a,d) of primes p for which the order of g(mod p) is congruent to a(mod d) is considered. It is shown, assuming the Generalized Riemann Hypothesis (GRH),…

数论 · 数学 2007-05-23 Pieter Moree

Let a and b be non-zero rational numbers that are multiplicatively independent. We study the natural density of the set of primes p for which the subgroup of the multiplicative group of the finite field with p elements generated by (a\mod…

数论 · 数学 2007-05-23 Pieter Moree , Peter Stevenhagen

We consider the set of monic irreducible polynomials $P$ over a finite field $\mathbb{F}_q$ such that the multiplicative order modulo $P$ of some a in $\mathbb{F}_q(T)$ is divisible by a fixed positive integer $d$. Call $R_q(a,d)$ this set.…

数论 · 数学 2025-10-21 Joaquim Cera Da Conceição

For positive integers $q$, Dirichlet's theorem states that there are infinitely many primes in each reduced residue class modulo $q$. A stronger form of the theorem states that the primes are equidistributed among the $\varphi(q)$ reduced…

数论 · 数学 2019-08-21 David Wu

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 compute the uniform probability that finitely many polynomials over a finite field are pairwise coprime and compare the result with the formula one gets using the natural density as probability measure. It will turn out that the formulas…

动力系统 · 数学 2017-11-09 Julia Lieb

In 2013, Zhi-Wei Sun proposed a Romanov-type conjecture stating that every integer $n > 1$ can be written as $n = k + m$ with $k, m \ge 1$ such that $2^k + m$ is a prime. In this paper, we unconditionally prove that the natural numbers…

数论 · 数学 2026-05-18 Songlin Han , Jinbo Yu

Chebyshev observed in a letter to Fuss that there tends to be more primes of the form $4n+3$ than of the form $4n+1$. The general phenomenon, which is referred to as Chebyshev's bias, is that primes tend to be biased in their distribution…

数论 · 数学 2016-01-20 Daniel Fiorilli

We obtain asymptotic bounds on the number of natural numbers less than $X$ satisfying $\gcd{\left(n,\lfloor P(n) \rfloor\right)}=1$, under some diophantine conditions on the coefficient of $x$ in $P$, and show that the density of such…

数论 · 数学 2024-11-25 Aahan Chatterjee

We determine the asymptotic density $\delta_k$ of the set of ordered $k$-tuples $(n_1,...,n_k)\in \N^k, k\ge 2$, such that there exists no prime power $p^a$, $a\ge 1$, appearing in the canonical factorization of each $n_i$, $1\le i\le k$,…

数论 · 数学 2007-05-23 László Tóth

Let $\pi(x;q,a)$ denote the number of primes up to $x$ that are congruent to $a$ modulo $q$. A prime number race, for fixed modulus $q$ and residue classes $a_1, \ldots, a_r$, investigates the system of inequalities $\pi(x;q,a_1) >…

数论 · 数学 2019-08-27 Greg Martin , Nathan Ng

Let A be a pre-defined set of rational numbers. We say a set of natural numbers S is an A-quotient-free set if no ratio of two elements in S belongs to A. We find the maximal asymptotic density and the maximal upper asymptotic density of…

组合数学 · 数学 2013-06-25 Tanya Khovanova , Sergei Konyagin

Let r : G_Q -> GL_n Q_l be a motivic l-adic Galois representation. For fixed m > 1 we initiate an investigation of the density of the set of primes p such that the trace of the image of an arithmetic Frobenius at p under r is an m^th power…

数论 · 数学 2007-05-23 Tom Weston

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

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 $A$ be the product of an abelian variety and a torus over a number field $K$, and let $m$ be a positive integer. If $\alpha \in A(K)$ is a point of infinite order, we consider the set of primes $\mathfrak p$ of $K$ such that the…

数论 · 数学 2021-07-01 Peter Bruin , Antonella Perucca

For pure extensions $K=\mathbb{Q}(\alpha)$ with $\alpha^n=m$, we give a short proof, based only on Dedekind's index theorem, of the $\alpha$-monogeneity criterion: $\mathbb{Z}[\alpha]=\mathcal{O}_K$ if and only if $m$ is square-free and…

数论 · 数学 2026-01-09 Khai-Hoan Nguyen-Dang , Nguyen Thai Hung

It is an open problem whether $ \binom{2n}{n} $ is divisible by 4 or 9 for all $n>256$. In connection with this, we prove that for a fixed uneven $m$ the asymptotic density of $k$'s such that $ m \nmid \binom{2^{k+1}}{2^{k}} $ is 0. To do…