Search Results
Search type | Search syntax |
---|---|
Tags | [tag] |
Exact | "words here" |
Author |
user:1234 user:me (yours) |
Score |
score:3 (3+) score:0 (none) |
Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
Views | views:250 |
Code | code:"if (foo != bar)" |
Sections |
title:apples body:"apples oranges" |
URL | url:"*.example.com" |
Saves | in:saves |
Status |
closed:yes duplicate:no migrated:no wiki:no |
Types |
is:question is:answer |
Exclude |
-[tag] -apples |
For more details on advanced search visit our help page |
Questions where prime numbers play a key-role, such as: questions on the distribution of prime numbers (twin primes, gaps between primes, Hardy–Littlewood conjectures, etc); questions on prime numbers with special properties (Wieferich prime, Wolstenholme prime, etc.). This tag is often used as a specialized tag in combination with the top-level tag nt.number-theory and (if applicable) analytic-number-theory.
15
votes
1
answer
932
views
Prove $4\sum_{k=1}^{p-1}\frac{(-1)^k}{k^2}\equiv 3\sum_{k=1}^{p-1}\frac{1}{k^2}\pmod{p^2}$
Wolstenholme's theorem is stated as follows:
if $p>3$ is a prime, then
\begin{align*}
\sum_{k=1}^{p-1}\frac{1}{k}\equiv 0 \pmod{p^2},\\
\sum_{k=1}^{p-1}\frac{1}{k^2} \equiv 0 \pmod{p}.
\end{align*}
It …
15
votes
2
answers
989
views
How to prove $\sum_{k=1}^{\frac{p-1}{2}}\frac{(-1)^k}{k}\sum_{i=\lfloor k/2\rfloor +1}^k\fra...
Numerical calculation suggests that for prime $p\ge 5$,
\begin{align*}
\sum_{k=1}^{\frac{p-1}{2}}\frac{(-1)^k}{k}\sum_{i=\lfloor k/2\rfloor +1}^k\frac{1}{2i-1}\equiv 0\pmod{p}.
\end{align*}
Questi …
1
vote
How to prove $\sum_{k=1}^{\frac{p-1}{2}}\frac{(-1)^k}{k}\sum_{i=\lfloor k/2\rfloor +1}^k\fra...
This is complementary to the note by Amdeberhan and Tauraso.
In order to solve this problem, Amdeberhan and Tauraso [Equations (12) and (15)] established the following two important results:
\begin{a …