Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 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

Quartic residues and sums involving $\binom{4k}{2k}$ (1311.6364v2)

Published 25 Nov 2013 in math.NT

Abstract: Let $p$ be an odd prime and let $m\not\equiv 0\pmod p$ be a rational p-adic integer. In this paper we reveal the connection between quartic residues and the sum $\sum_{k=0}{[p/4]}\binom{4k}{2k}\frac 1{mk}$, where $[x]$ is the greatest integer not exceeding $x$. Let $q$ be a prime of the form $4k+1$ and so $q=a2+b2$ with $a,b\in\Bbb Z$. When $p\nmid ab(a2-b2)q$, we show that for $r=0,1,2,3$, $p{\frac{q-1}4}\equiv (\frac ab)r\pmod q$ if and only if $$\sum_{k=0}{[p/4]}\binom{4k}{2k}\Big(\frac{a2}{16q}\Big)k\equiv (-1){\frac{p2-1}8a+\frac{p-1}2\cdot \frac{q-1}4}\Big(\frac pq\Big) \Big(\frac ab\Big)r\pmod p,$$ where $(\frac pq)$ is the Legendre symbol. We also establish congruences for $\sum_{k=0}{[p/4]}\binom{4k}{2k}\frac 1{mk}\pmod p$ in the cases $m=17,18,20,32,52,80,272$.

Summary

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