English
Related papers

Related papers: Asymptotically exact heuristics for (near) primiti…

200 papers

Suppose that $n$ is $0$ or $4$ modulo $6$. We show that there are infinitely many primes of the form $p^2 + nq^2$ with both $p$ and $q$ prime, and obtain an asymptotic for their number. In particular, when $n = 4$ we verify the `Gaussian…

Number Theory · Mathematics 2024-10-15 Ben Green , Mehtaab Sawhney

Let $G$ be a finite group and $n_p(G)$ the number of Sylow $p$-subgroups of $G$. In this paper, we prove if $n_p(G)<p^2$ then almost all numbers $n_p(G)$ are a power of a prime.

Group Theory · Mathematics 2024-06-25 Xiaofang Gao , Igor Lima , Rulin Shen

We introduce a heuristic prediction for the distribution of the isomorphism class of the Galois group of the maximal pro-p extension of Q unramified outside a "random" set of primes. This is guided by reasoning similar to that governing the…

Group Theory · Mathematics 2012-04-20 Nigel Boston , Jordan S. Ellenberg

For $n \geq 3$, an asymptotic formula is derived for the number of representations of a sufficiently large natural number $N$ in the form $p_1+p_2+m^n=N$, where $p_1$, $p_2$ $-$ prime numbers, $m$ $-$ natural number satisfying the…

Number Theory · Mathematics 2025-10-08 Firuz Rakhmonov

Rubinstein and Sarnak have shown, conditional on the Riemann hypothesis (RH) and the linear independence hypothesis (LI) on the non-real zeros of $\zeta(s)$, that the set of real numbers $x\ge2$ for which $\pi(x)>$ li$(x)$ has a logarithmic…

Number Theory · Mathematics 2019-09-04 Jared Duker Lichtman , Greg Martin , Carl Pomerance

E. Bach, following an idea of T. Itoh, has shown how to build a small set of numbers modulo a prime p such that at least one element of this set is a generator of $\pF{p}$\cite{Bach:1997:sppr,Itoh:2001:PPR}. E. Bach suggests also that at…

Symbolic Computation · Computer Science 2008-12-09 Jacques Dubrois , Jean-Guillaume Dumas

We establish asymptotic formulas for sums of reciprocals of primes in arithmetic progressions, generalizing recent results on multiple Mertens evaluations by Tenenbaum, Qi, and Hu. Specifically, for any fixed constant $K>0$, we derive…

Number Theory · Mathematics 2025-12-09 Zhen Chen , Junrong Luo

We study additive properties of consecutive prime numbers and the primality of the sums they generate. For a given prime number $p_n$, we consider the sums \[ S_k(p_n) = p_n + p_{n+1} + \cdots + p_{n+k-1}, \] where $k \ge 3$ is an odd…

General Mathematics · Mathematics 2026-01-23 Edwige Tolla

We discuss heuristic asymptotic formulae for the number of pairing-friendly abelian varieties over prime fields, generalizing previous work of one of the authors arXiv:math1107.0307

Number Theory · Mathematics 2019-02-20 John Boxall , David Gruenewald

We improve Bombieri's asymptotic sieve to localise the variables. As a consequence, we prove, under a Elliott-Halberstam conjecture, that there exists an infinity of twins almost prime. Those are prime numbers $p$ such that for all…

Number Theory · Mathematics 2019-07-16 Nathalie Debouzy

A set $A$ is an $(r,\ell)$-approximate group in the additive abelian group $G$ if $A$ is a nonempty subset of $G$ and there exists a subset $X$ of $G$ such that $|X| \leq \ell$ and $rA \subseteq X+A$. The set $A$ is an asymptotic…

Number Theory · Mathematics 2020-04-17 Melvyn B. Nathanson

A finite group with a cyclic normal subgroup N such that G/N is cyclic is said to be metacyclic. A code over a finite field F is a metacyclic code if it is a left ideal in the group algebra FG for G a metacyclic group. Metacyclic codes are…

Information Theory · Computer Science 2019-06-19 Martino Borello , Pieter Moree , Patrick Solé

This paper considers a probabilistic-analytical approach to determining asymptotics of prime objects on the initial interval of the natural series. The author proposes a new method based on the construction of a probability space. An…

Number Theory · Mathematics 2025-04-01 Victor Volfson

We define a new congruence relation on the set of integers, leading to a group similar to the multiplicative group of integers modulo $n$. It makes use of a symmetry almost omnipresent in modular multiplications and halves the number of…

Number Theory · Mathematics 2016-02-09 Tim Beyne , Gerold Brändli

Let $K$ be a field and $G$ be a finite group. Let $G$ act on the rational function field $K(x(g):g\in G)$ by $K$-automorphisms defined by $g\cdot x(h)=x(gh)$ for any $g,h\in G$. Denote by $K(G)$ the fixed field $K(x(g):g\in G)^G$. Noether's…

Algebraic Geometry · Mathematics 2013-09-04 Ivo M. Michailov

Fix an odd prime $p$, and let $F$ be a field containing a primitive $p$th root of unity. It is known that a $p$-rigid field $F$ is characterized by the property that the Galois group $G_F(p)$ of the maximal $p$-extension $F(p)/F$ is a…

Number Theory · Mathematics 2013-10-31 Sunil K. Chebolu , Jan Minac , Claudio Quadrelli

We show under the Generalised Riemann Hypothesis that for every $\delta>0$, almost every prime $q$ in $[Q,2Q]$ has the expected of prime primitive roots in the interval $[x,x+x^{\frac{1}2+\delta}]$ provided $Q$ is not more than…

Number Theory · Mathematics 2017-03-02 D. S. Ramana , O. Ramaré

Fix an integer $r\geq 3$. Let $q$ be a large positive integer and $a_1,...,a_r$ be distinct residue classes modulo $q$ that are relatively prime to $q$. In this paper, we establish an asymptotic formula for the logarithmic density…

Number Theory · Mathematics 2011-01-06 Youness Lamzouri

Let $p=3n+1$ be a prime with $n\in\mathbb{N}=\{0,1,\cdots\}$, and let $g\in\mathbb{Z}$ be a primitive root modulo $p$. Let $0<a_1<\cdots<a_n<p$ be all the cubic residues modulo $p$ in the interval $(0,p)$. Then clearly the sequence $$a_1\…

Number Theory · Mathematics 2021-05-21 Hai-Liang Wu , Yue-Feng She

For a subset $\mathcal A\subset \mathbb N$, let $p_{\mathcal A}(n)$ denote the restricted partition function which counts partitions of $n$ with all parts lying in $\mathcal A$. In this paper, we use a variation of the Hardy-Littlewood…

Number Theory · Mathematics 2021-02-23 Ayla Gafni
‹ Prev 1 4 5 6 7 8 10 Next ›