Square-full primitive roots
From MaRDI portal
Abstract: We use character sum estimates to give a bound on the least square-full primitive root modulo a prime. Specifically, we show that there is a square-full primitive root mod less than , and we give some conditional bounds.
Recommendations
Cites work
- Character sums over squarefree and squarefull numbers
- Density of non-residues in Burgess-type intervals and applications
- scientific article; zbMATH DE number 3813704 (Why is no real title available?)
- scientific article; zbMATH DE number 3946241 (Why is no real title available?)
- scientific article; zbMATH DE number 1542664 (Why is no real title available?)
- scientific article; zbMATH DE number 5678244 (Why is no real title available?)
- Multiplicative number theory. I. Classical theory
- On Character Sums and Primitive Roots†
- On the least prime primitive root
- On the least square-free primitive root modulo \(p\)
- Searching for Primitive Roots in Finite Fields
- The least quadratic non residue
- The spectrum of multiplicative functions
Cited in
(14)- On the primitive roots and the generalized Golomb's conjecture
- Square-full primitive roots in arithmetic progressions
- On the distribution of \(r\)-full primitive roots
- Character sums over generalized square-full integers and applications
- On smooth square-free numbers in arithmetic progressions
- Square-full primitive roots in short intervals
- Pairs of primitive roots
- Smooth squarefree and squarefull integers in arithmetic progressions
- scientific article; zbMATH DE number 7166518 (Why is no real title available?)
- On the least primitive root expressible as a sum of two squares
- Square-free and square-full part of an integer
- Cube-full primitive roots
- On the squarefree and squarefull numbers
- A new arithmetical function and its mean value properties
This page was built for publication: Square-full primitive roots
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4639962)