On the order of finitely generated subgroups of \(\mathbb{Q}^*\pmod p\) and divisors of \(p-1\) (Q1912284)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the order of finitely generated subgroups of \(\mathbb{Q}^*\pmod p\) and divisors of \(p-1\) |
scientific article; zbMATH DE number 874192
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the order of finitely generated subgroups of \(\mathbb{Q}^*\pmod p\) and divisors of \(p-1\) |
scientific article; zbMATH DE number 874192 |
Statements
On the order of finitely generated subgroups of \(\mathbb{Q}^*\pmod p\) and divisors of \(p-1\) (English)
0 references
6 May 1996
0 references
Let \(a_1,\dots, a_r\) be multiplicatively independent non-zero integers, and let \(G_p\) be the multiplicative group that they generate modulo \(p\). It is not hard to show that if \(f(p)\) tends to infinity with \(p\), then \(\# G_p\geq (p/ f(p))^{r/(r+ 1)}\) for almost all \(p\). The paper improves this to \[ \# G_p\geq p^{r/(r+ 1)} \exp \Biggl\{{\log^\tau p\over \exp(f(p) \sqrt{\log\log p})}\Biggr\}, \] where \(\tau= (1- \log 2)/2> 0\). A number of related results are given. The key ingredient in the proofs is a delicate upper bound for the number of primes \(p\) up to \(x\) for which \(p- 1\) has a divisor in a specified range.
0 references
primitive roots
0 references
multiplicatively independent integers
0 references
lower bound on the order of a multiplicative group
0 references
0.8960164
0 references
0.89107335
0 references
0.8906083
0 references
0.8902781
0 references
0.8891216
0 references