A generalization on the difference between an integer and its inverse modulo \(q\). II (Q2577609): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3792/pjaa.81.7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997616959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5539082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Kloosterman's sum / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(n\)-dimensional Kloosterman sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the difference between an integer and its inverse modulo \(n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the difference between an integer and its inverse modulo \(n\). II / rank
 
Normal rank

Latest revision as of 13:38, 11 June 2024

scientific article
Language Label Description Also known as
English
A generalization on the difference between an integer and its inverse modulo \(q\). II
scientific article

    Statements

    A generalization on the difference between an integer and its inverse modulo \(q\). II (English)
    0 references
    3 January 2006
    0 references
    Let \(q>2\) and \(c\) be two integers with \((q,c)=1\). For each integer \(0<a<q\) with \((a,q)=1\) define \(b\) by the congruence \(ab\equiv c\pmod q\) and \(0<b<q\). The authors study the asymptotic behaviour of the function \[ M(q,k,c)=\sum_{\substack{ 1\leq a,b\leq q\\(a,q)=1,ab\equiv c\pmod q}}(a-b)^{2k}. \] They prove for any positive integer \(k\) \[ M(q,k, c)=\frac{\varphi(q)q^{2k}} {2k+1}+O\bigl(4^kq^{2k+ \tfrac12}d^2 (q) \ln q\bigr), \] where \(\varphi(q)\) is the Euler function and \(d(n)\) the divisor function. They replace \(a\) by \(a_1,a_2,\dots,a_n\) and sum over each \(a_i\), \(1\leq a_i\leq q\), \((a_i,q)=1\), to get a more general formula.
    0 references
    0 references
    0 references

    Identifiers