Skip to content
naulon
Not checkedNot checked for notices yet.

Several generalizations on Wolstenholme Theorem

Zhu Yuyang, Huang Jing, Wang Lili and 1 more

MATEC Web of Conferences · 2022

doi:10.1051/matecconf/202235502003 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

This paper generalizes Wolstenholme theorem on two aspects. The first generalization is a parameterized form: let p > k + 2, k ≥ 1, ∀t ∈ ℤ, then ${{(pt + p - 1)!} \over {(pt)!}}\mathop \sum \limits_{m = 0}^{k - 1} {( - 1)^m}\mathop \sum \limits_{1 \le {i_l} < \cdots < {i_{k - m}} \le p - 1} {{{p^{k - (m + 1)}}} \over {\mathop \prod \limits_{l = 1}^{k - m} (pt + {i_l})}} \equiv 0{\left( {\bmod {p^{k + 1}}} \right)^.}$ The second generalization is on composite number module: Let 1overa be the x in congruent equation ax ≡ 1(mod m )(1 ≤ x < m ), if m ≥ 5, then $$\matrix{ {\sum\limits_{\scriptstyle (k,m) = 1, \hfill \atop \scriptstyle 1 \le j \le m \hfill} {{{\left( {{1 \over k}} \right)}^2}} } \hfill & \equiv \hfill & {{m \over 6}[2m\varphi (m) + \prod\limits_{p|m} {(1 - p)]{{(\bmod m)}^{\;;}}} } \hfill \cr {\sum\limits_{\scriptstyle (k,m) = 1, \hfill \atop \scriptstyle 1 \le j \le m \hfill} {{{\left( {{1 \over k}} \right)}^3}} } \hfill & \equiv \hfill & {{{{m^2}} \over 4}[m\varphi (m) + \prod\limits_{p|m} {(1 - p)](\bmod m){\;^;}} } \hfill \cr {\sum\limits_{\scriptstyle (k,m) = 1, \hfill \atop \scriptstyle 1 \le j \le m \hfill} {{{\left( {{1 \over k}} \right)}^4}} } \hfill & \equiv \hfill & {{m \over {30}}[6{m^3}\varphi (m) + 10{m^2}\prod\limits_{p|m} {(1 - p) - \prod\limits_{p|m} {(1 - {p^3})](\bmod m){\;^;}} } } \hfill \cr {\sum\limits_{\scriptstyle (k,m) = 1, \hfill \atop \scriptstyle 1 \le j \le m \hfill} {{{\left( {{1 \over k}} \right)}^r}} } \hfill & \equiv \hfill & {{m^r}\sum\limits_{d|m} {\mu (d){{\left( {{m \over d}} \right)}^{ - r}}\sum\limits_{k = 1}^{{m \over d}} {{k^r}(\bmod m){\;^.}} } } \hfill \cr } $$ Where φ(x) is Euler function , μ(x) is Möbius function.

Abstract licence: CC BY

References4

    4 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.