Papers
Topics
Authors
Recent
Search
2000 character limit reached

Congruences for partial sums of the generating series for $\binom{3k}{k}$

Published 12 Oct 2022 in math.NT | (2210.06146v1)

Abstract: We produce congruences modulo a prime $p>3$ for sums $\sum_k\binom{3k}{k}xk$ over ranges $0\le k<q$ and $0\le k<q/3$, where $q$ is a power of $p$. Here $x$ equals either $c2/(1-c)3$, or $4s2/\bigl(27(s2-1)\bigr)$, where $c$ and $s$ are indeterminates. In the former case we deal more generally with shifted binomial coefficients $\binom{3k+e}{k}$. Our method derives such congruences directly from closed forms for the corresponding series.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.