On p-adic approximation of sums of binomial coefficients
Rustem R. Aidagulov, Max A. Alekseyev

TL;DR
This paper introduces advanced p-adic approximation techniques for binomial coefficients, providing explicit formulas for linear combinations divisible by high powers of a prime, extending Jacobsthal's work.
Contribution
It presents higher-order generalizations of Jacobsthal's p-adic approximation, offering new explicit formulas for binomial coefficient sums with divisibility properties.
Findings
Derived explicit formulas for binomial sums divisible by large powers of p
Extended Jacobsthal's p-adic approximation to higher orders
Established divisibility results for linear combinations of binomial coefficients
Abstract
We propose higher-order generalizations of Jacobsthal's -adic approximation for binomial coefficients. Our results imply explicit formulae for linear combinations of binomial coefficients () that are divisible by arbitrarily large powers of prime .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
