A characterization of a prime p from the binomial coefficient {n \choose p}

MaRDI QIDQ6235589zbMATH OpenFDO

Authors Alexandre Laugier, Manjil Pratim Saikia

Publication date 7 September 2012

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Binomial coefficients; factorials; (q)-identities (11B65) Primes (11A41) Factorization; primality (11A51)

Abstract: We complete a proof of a theorem that was inspired by an Indian Olympiad problem, which gives an interesting characterization of a prime number $p$ with respect to the binomial coefficients $nchoosep$. We also derive a related result which generalizes the theorem in one direction.

Recommendations

• Binomial symbols and prime moduli
• ON DIVISIBILITY OF ${\fontsize{9}{11}\selectfont\Big(\!\!\begin{array}{c}n-i-1\\[2pt]i-1\end{array}\!\!\Big)}$ by i
• Sur les coefficients du binôme
• A Story of Binomial Coefficients and Primes
• On Prime Divisors of Binomial Coefficients

This page was built for publication: A characterization of a prime $p$ from the binomial coefficient ${n \choose p}$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6235589)