Let p>3 be a prime. We prove that
k=0∑p−1(k2k)/2k=(−1)(p−1)/2−p2Ep−3(modp3),k=1∑(p−1)/2(k2k)/k=(−1)(p+1)/28/3∗pEp−3(modp2),k=0∑(p−1)/2(k2k)2/16k=(−1)(p−1)/2+p2Ep−3(modp3), where E_0,E_1,E_2,... are Euler numbers. Our new approach is of
combinatorial nature. We also formulate many conjectures concerning super
congruences and relate most of them to Euler numbers or Bernoulli numbers.
Motivated by our investigation of super congruences, we also raise a conjecture
on 7 new series for π2, π−2 and the constant
K:=∑k>0(k/3)/k2 (with (-) the Jacobi symbol), two of which are
k=1∑∞(10k−3)8k/(k3(k2k)2(k3k))=π2/2 and
\sum_{k>0}(15k-4)(-27)^{k-1}/(k^3\binom{2k}{k}^2\binom{3k}k)=K.$