Congruences of multiple sums involving invariant sequences under binomial transform

Abstract

We will prove several congruences modulo a power of a prime such as Σ0<k1<...<kn<pp-kn3 (-1)kn k1... kn lll -2n+1+2 6n+1 p Bp-n-1(1 3) &p2 &if n is odd -2n+1+4 n6n Bp-n(1 3) &p &if n is even. where n is a positive integer and p is prime such that p>(n+1,3).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…