English
Related papers

Related papers: Computation of the least primitive root

200 papers

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

Write $T(n)$ as the sum of the reciprocals of the primes which divide $n$. Write $H(n) = \prod_{p|n}p/(p-1)$ where the product is over the prime divisors of $n$. We prove new bounds for $T(n)$ and $H(n)$ in terms of the smallest prime…

Number Theory · Mathematics 2025-02-11 Joshua Zelinsky

In this paper we prove the supercongruence $$\sum_{n=0}^{(p-1)/2}\frac{6n+1}{256^n}\binom{2n}n^3\equiv p(-1)^{(p-1)/2}+(-1)^{(p-1)/2}\frac{7}{24}p^4B_{p-3}\pmod{p^5}$$ for any prime $p>3$, which was conjectured by Sun in 2019.

Number Theory · Mathematics 2021-09-22 Guo-Shuai Mao , Zhi-Wei Sun

Let $p$ be a prime number, $p=2^nq+1$, where $q$ is odd. D. Shanks described an algorithm to compute square roots $\pmod{p}$ which needs $O(\log q + n^2)$ modular multiplications. In this note we describe two modifications of this…

Number Theory · Mathematics 2011-05-10 Jan-Christoph Schlage-Puchta

In this note, we review some facts about polynomials representing functions modulo primes p. In addition we prove that the polynomial f(x) = x^{p-2} + x^{p-3} + ... + x^3 + x^2 + 2x + 1 represents the transposition (0 1) modulo p, that is,…

Number Theory · Mathematics 2007-05-23 Greg Martin

Elementary symmetric polynomials $S_n^k$ are used as a benchmark for the bounded-depth arithmetic circuit model of computation. In this work we prove that $S_n^k$ modulo composite numbers $m=p_1p_2$ can be computed with much fewer…

Computational Complexity · Computer Science 2007-05-23 Vince Grolmusz

Given an odd prime $p$, we provide formulas for the Hensel lifts of polynomial roots modulo $p$, and give an explicit factorization over the ring of formal power series with integer coefficients for certain reducible polynomials whose…

Number Theory · Mathematics 2014-12-17 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

We develop a simple $O((\log n)^2)$ test as an extension of Proth's test for the primality for $p2^n+1$, $p>2^n$. This allows for the determination of large, non-Sierpinski primes $p$ and the smallest $n$ such that $p2^n+1$ is prime. If $p$…

Number Theory · Mathematics 2018-11-16 Tejas R. Rao

We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by…

Number Theory · Mathematics 2022-01-19 Amit Ghosh , Kenneth Ward

Let $p>3$ be a prime. For any $p$-adic integer $a$, we determine $$\sum_{k=0}^{p-1}\binom{-a}k\binom{a-1}kH_k,\ \ \sum_{k=0}^{p-1}\binom{-a}k\binom{a-1}kH_k^{(2)},\ \ \sum_{k=0}^{p-1}\binom{-a}k\binom{a-1}k\frac{H_k^{(2)}}{2k+1}$$ modulo…

Number Theory · Mathematics 2024-01-11 Zhi-Wei Sun

Let $p$ be a prime, and let $k,n,m,n_0$ and $m_0$ be nonnegative integers such that $k\ge 1$, and $_0$ and $m_0$ are both less than $p$. K. Davis and W. Webb established that for a prime $p\ge 5$ the following variation of Lucas' Theorem…

Number Theory · Mathematics 2013-01-03 Romeo Mestrovic

In [E. S. Gawlik, Zolotarev iterations for the matrix square root, arXiv preprint 1804.11000, (2018)], a family of iterations for computing the matrix square root was constructed by exploiting a recursion obeyed by Zolotarev's rational…

Numerical Analysis · Mathematics 2019-03-18 Evan S. Gawlik

Let N and p be two prime numbers > 3 such that p divides N-1. We estimate the p-rank of the class group of Q(N^(1/p)) in terms of the discrete logarithm, with values un F_p, of certain units. Using the Gross--Koblitz formula and identities…

Number Theory · Mathematics 2018-04-04 Emmanuel Lecouturier

Let $p$ be a prime, $k$ be an algebraically closed field of characteristic $p$. In this paper, we provide the classification of connected Hopf algebras of dimension $p^3$, except the case when the primitive space of the Hopf algebra is two…

Rings and Algebras · Mathematics 2015-11-10 Van C. Nguyen , Linhong Wang , Xingting Wang

We consider natural polynomial truncations of hypergeometric power series defined over finite fields. For these truncations, we establish asymptotic upper bounds of order $O(p^{11/12})$ on the number of roots in the prime field…

Number Theory · Mathematics 2020-04-24 Amit Ghosh , Kenneth Ward

For fixed prime integer $p > 0$ we develop a notion of Bernstein-Sato polynomial for polynomials with $\mathbb{Z} / p^m$-coefficients, compatible with existing theory in the case $m = 1$. We show that the ``roots" of such polynomials are…

Commutative Algebra · Mathematics 2026-05-27 Thomas Bitoun , Eamon Quinlan-Gallego

Let $p$ be an odd prime and let $d\in\{2,3,7\}$. When $(\frac{-d}p)=1$ we can write $p=x^2+dy^2$ with $x,y\in\mathbb Z$; in this paper we aim at determining $x$ or $y$ modulo $p^2$. For example, when $p=x^2+3y^2$, we show that if $p\equiv…

Number Theory · Mathematics 2015-06-09 Zhi-Wei Sun

Given a connected reductive algebraic group $G$, we consider the class of spherical subgroups $H \subset G$ such that $H$ is regularly embedded in a parabolic subgroup $P \subset G$ and $H,P$ have a common Levi subgroup $L$. In a previous…

Algebraic Geometry · Mathematics 2026-04-09 Roman Avdeev

Let $f\colon\mathbb{N}\rightarrow\mathbb{N}_0$ be a multiplicative arithmetic function such that for all primes $p$ and positive integers $\alpha$, $f(p^{\alpha})<p^{\alpha}$ and $f(p)\vert f(p^{\alpha})$. Suppose also that any prime that…

Number Theory · Mathematics 2015-01-27 Colin Defant

Let H(N) denote the Hurwitz class number. It is known that if $p$ is a prime, then {equation*} \sum_{|r|<2\sqrt p}H(4p-r^2) = 2p. {equation*} In this paper, we investigate the behavior of this sum with the additional condition $r\equiv…

Number Theory · Mathematics 2012-08-24 Brittany Brown , Neil J. Calkin , Timothy B. Flowers , Kevin James , Ethan Smith , Amy Stout