首页 | 本学科首页   官方微博 | 高级检索  
     检索      


p-Catalan numbers and squarefree binomial coefficients
Authors:Pantelimon St?nic?
Institution:Department of Mathematics, Auburn University Montgomery, Montgomery, AL 36124-4023, USA
Abstract:In this paper, we consider the generalized Catalan numbers View the MathML source, which we call s-Catalan numbers. For p prime, we find all positive integers n such that pq divides F(pq,n), and also determine all distinct residues of View the MathML source, q?1. As a byproduct we settle a question of Hough and the late Simion on the divisibility of the 4-Catalan numbers by 4. In the second part of the paper we prove that if pq?99999, then View the MathML source is not squarefree for n?τ1(pq) sufficiently large (τ1(pq) computable). Moreover, using the results of the first part, we find n<τ1(pq) (in base p), for which View the MathML source may be squarefree. As consequences, we obtain that View the MathML source is squarefree only for n=1,3,45, and View the MathML source is squarefree only for n=1,4,10.
Keywords:Binomial coefficients  Catalan numbers  Congruences  Squarefree numbers
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号