<p>We give elementary proofs of some congruence criteria to compute binomial coefficients modulo a prime number. These criteria are analogues to the symmetry property of binomial coefficients. We give extended version of Lucas’s Theorem by using those criteria. We give applications of these criteria by describing a method to derive identities and congruences involving sums of binomial coefficients.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

An extension of Lucas’s Theorem

  • Zubeyir Cinkir,
  • Aysegul Ozturkalan

摘要

We give elementary proofs of some congruence criteria to compute binomial coefficients modulo a prime number. These criteria are analogues to the symmetry property of binomial coefficients. We give extended version of Lucas’s Theorem by using those criteria. We give applications of these criteria by describing a method to derive identities and congruences involving sums of binomial coefficients.