Simple arguments on consecutive power residues

Combinatorial identities, bijective combinatorics (05A19) Congruences; primitive roots; residue systems (11A07) Power residues, reciprocity (11A15) Quadratic extensions (11R11)

Abstract: By some extremely simple arguments, we point out the following: (i) If n is the least positive k-th power non-residue modulo a positive integer m, then the greatest number of consecutive k-th power residues mod m is smaller than m/n. (ii) Let O_K be the ring of algebraic integers in a quadratic field

K = Q (s q r t d)

with d in {-1,-2,-3,-7,-11}. Then, for any irreducible

p i i n O_{K}

and positive integer k not relatively prime to

, there exists a k-th power non-residue

o m e g a i n O_{K}

modulo

p i

such that

| o m e g a | < s q r t | p i | + 0.65

.

Review text

The author shows that the number of consecutive \(k\)-th power residues modulo \(m\) is bounded from above by \(m/n\), where \(n = n_k(m)\) is the least positive \(k\)-th power nonresidue modulo \(m\). In fact, assume that \(a+1, \ldots, a+R\) are \(k\)-th power residues mod \(m\), and let \(q = \lceil an/m \rceil\). Then \((a+i)n-mq\) is a \(k\)-th power nonresidue mod \(m\) for each \(i \in \{1, \dots, R\}\). But if \((a+i)n-mq \geq 0\) for some \(i\), then \((a+i)n-mq \geq n\). From \(an - qm < 0\) we now deduce inductively that \((a+R)n-mq < 0\), which implies the claim. This argument is then generalized to Euclidean complex quadratic number fields.

Recommendations

Cites work

Cited in

(5)

This page was built for publication: Simple arguments on consecutive power residues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877922)