A congruence involving the quotients of Euler and its applications (I) (Q4548865)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1789563
Language Label Description Also known as
default for all languages
No label defined
    English
    A congruence involving the quotients of Euler and its applications (I)
    scientific article; zbMATH DE number 1789563

      Statements

      A congruence involving the quotients of Euler and its applications (I) (English)
      0 references
      0 references
      27 August 2002
      0 references
      Fermat quotient
      0 references
      Euler quotient
      0 references
      congruences
      0 references
      binomial coefficients
      0 references
      Bernoulli numbers
      0 references
      Let \(n\) be an odd integer \(>1\) and let \(\chi_n\) denote the trivial character mod \(n\). The author proves that \[ \sum_{i=1}^{(n-1)/2}{\chi_n(i)\over{i}} \equiv -2q_2(n) + nq_2^2(n)\pmod {n^2}, \] where \(q_2(n)\) is the Euler quotient \((2^{\varphi(n)}-1)/n\). For \(n=p\), an odd prime, this was proved already by \textit{E. Lehmer} [Ann. Math. (2) 39, 350-360 (1938; Zbl 0019.00505)]. The author's proof uses an identity due to \textit{J. Szmidt, J. Urbanowicz} and \textit{D. Zagier} [Acta Arith. 71, 273-278 (1995; Zbl 0829.11011)], establishing a relationship between certain character sums and generalized Bernoulli numbers. As applications there are many new congruences for binomial coefficients, for example, \[ (-1)^{\varphi(n)/2}\prod_{d|n}{d-1\choose (d-1)/2} ^{\mu(n/d)} \equiv 4^{\varphi(n)}\pmod m, \] where \(\mu(n)\) is the Möbius function and \(m\) equals \(n^3/3\) or \(n^3\) according to whether or not \(n\) is divisible by 3.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references