Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Cubic congruences and sums involving $\binom{3k}k$ (1310.6721v7)

Published 24 Oct 2013 in math.NT and math.CO

Abstract: Let $p$ be a prime greater than $3$ and let $a$ be a rational p-adic integer. In this paper we try to determine $\sum_{k=1}{[p/3]}\binom{3k}kak\pmod p$, and real the connection between cubic congruences and the sum $\sum_{k=1}{[p/3]}\binom{3k}kak$, where $[x]$ is the greatest integer not exceeding $x$. Suppose that $a_1,a_2,a_3$ are rational p-adic integers, $P=-2a_13+9a_1a_2-27a_3$, $Q=(a_12-3a_2)3$ and $PQ(P2-Q)(P2-3Q)(P2-4Q)\not\equiv 0\pmod p$. In this paper we show that the number of solutions of the congruence $x3+a_1x2+a_2x+a_3\equiv 0\pmod p$ depends only on $\sum_{k=1}{[p/3]}\binom{3k}k(\frac{4Q-P2}{27Q})k\pmod p$. Let $q$ be a prime of the form $3k+1$ and so $4q=L2+27M2$ with $L,M\in\Bbb Z$. When $p\not=q$ and $p\nmid L$, we establish congruences for $\sum_{k=1}{[p/3]}\binom{3k}k(\frac{M2}q)k$ and $\sum_{k=1}{[p/3]}\binom{3k}k(\frac{L2}{27q})k$ modulo p. As a consequence, we show that $x3-qx-qM\equiv 0\pmod p$ has three solutions if and only if $p$ is a cubic residue of $q$.

Summary

We haven't generated a summary for this paper yet.