Binomial coefficients, Catalan numbers and Lucas quotients (Q625839)

The author proves congruences with binomial coefficients, Catalan numbers and Lucas sequences. For example: \[ \sum_{k = 0}^{p^a - 1} \frac{\binom{2k}{k}}{m^k} \equiv \left( {\frac{{m^2 - 4m}} {{p^a }}} \right) + \left( {\frac{{m^2 - 4m}} {{p^{a - 1} }}} \right)u_{p - (\frac{{m^2 - 4m}} {p})} \pmod {p^2}, \] where \(p\) is an odd prime, \(a,m\in{\mathbb Z}\), \(a>0\), \(p\nmid m\), \((-)\) is the Jacobi symbol and \(\{u_n\}_{n \geq 0}\) is the Lucas sequence given by \(u_{0} = 0, u_{1} = 1\) and \(u_{n+1} = (m - 2)u_n - u_{n-1} (n = 1, 2, 3, \dots )\). If \(a\) is odd and \(r\in\{1,\dots,p-1\}\), then, for the Catalan numbers \(C_n\), \[ \sum_{\substack{ 0<k<p^a\\k\equiv r\pmod {p-1}}} C_k\equiv C_r\pmod {p^2}. \]