Cubic congruences and sums involving $\binom{3k}k$
Zhi-Hong Sun

TL;DR
This paper investigates the relationship between cubic congruences and specific binomial sum expressions modulo primes, providing new formulas and criteria for the number of solutions of cubic equations over finite fields.
Contribution
It introduces novel congruences connecting cubic polynomial solutions with sums involving binomial coefficients and explores their implications for cubic residues.
Findings
Derived formulas for sums involving binomial coefficients modulo primes.
Established criteria linking cubic residues to the number of solutions of cubic equations.
Connected cubic congruences with binomial sums and quadratic forms.
Abstract
Let be a prime greater than and let be a rational p-adic integer. In this paper we try to determine , and real the connection between cubic congruences and the sum , where is the greatest integer not exceeding . Suppose that are rational p-adic integers, , and . In this paper we show that the number of solutions of the congruence depends only on . Let be a prime of the form and so with . When and , we establish congruences for and modulo…
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.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Advanced Mathematical Identities · Analytic Number Theory Research
