scientific article; zbMATH DE number 3912461

From MaRDI portal
Publication:3689244





The Pascal triangle and its generalizations were used earlier by the author [Operator algorithms in differential equations (1984; Zbl 0551.34001)] for finding polynomial solutions of partial differential equations. In the present paper the author investigates the distribution of residues modulo a prime number p of coefficients in Pascal, Fibonacci and Lucas triangles. Many illustrations and examples help understanding. The following two theorems are given (without proofs). Theorem 1. Let p be a prime number. The number of binomial coefficients in the nth row of the Pascal triangle which are not divisible by p, equals \((a_ k+1)(a_{k-1}+1)...(a_ 1+1)(a_ 0+1)\) where \(n=(a_ ka_{k- 1}...a_ 1a_ 0)_ p)\) is the representation of n in base p, i.e. \(n=a_ kp^ k+a_{k-1}p^{k-1}+...+a_ 1p+a_ 0.\quad -\) From this result it follows that in the \((p^ k-1)th\) row of the Pascal triangle none of the binomial coefficients is divisible by p, and in the \(p^ kth\) row there are only two coefficients divisible by p. For the case \(p=2\) these facts were noted earlier by \textit{S. H. L. Kung} [Parity triangles of Pascal's triangle, Fibonacci Q. 14, 54 (1976)]. Theorem 2. Let a prime p and \(n\in {\mathbb{N}}\) be fixed. Then among the binomial numbers \(\left( \begin{matrix} r\\ s\end{matrix} \right)\), \(r\in \{0,1,...,n\}\) and \(s\in \{0,1,...,r\}\) there are \(G(n,p)=\sum^{k}_{j=0}b_{k-j} v(k,j) q^{k-j}\) of them which are not divisible by p. Here \(b_ i\) are the digits in the representation of \(n+1\) to the base p, \((n+1)_ p=(b_ kb_{k-1}...b_ 1b_ 0)_ p\) and \(q=p (p+1)/2,\quad v(k,j)=\prod^{j}_{i=0}(b_{i-1}+1),\) \(j\in \{0,...,k\}\). The question about the growth of the numbers G(n,p) for \(n\to \infty\) is also investigated.




Cited in
(39)








This page was built for publication:

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