On a conjecture of Chowla et al
From MaRDI portal
Let \[ N(m,n)= \sum_{k=0}^n \binom {n}{k}^2 \binom{n+k}{k}^m \] where \(m\geq 0\). The author proves several congruences involving the \(N(m,n)\), for example: \[ N(m,p)\equiv 1+2^m\pmod{p^3} \] if the prime \(p>3\).
Recommendations
- On a conjecture of Chowla and Chowla
- On S. Chowla's conjecture
- On a conjecture of Chowla and Walum
- On Two Conjectures of Chowla
- scientific article; zbMATH DE number 7136177
- On a conjecture of Chowla and Milnor
- scientific article; zbMATH DE number 1978317
- Chowla's conjecture
- Proof of a conjecture of S. Chowla
Cites work
Cited in
(12)- Über eine Verallgemeinerung des Problems von Chowla and Walum. (On a generalization of the Chowla-Walum conjecture)
- On a conjecture of S. Chowla and of S. Chowla and H. Walum. II
- A new result on Chvátal's conjecture
- On several results of Chandrasekaran-Tamir conjecture
- Equal binomial coefficients: Some elementary considerations
- On S. Chowla's conjecture
- Punishing factors and Chua's conjecture
- scientific article; zbMATH DE number 3897019 (Why is no real title available?)
- Equivalence of the Logarithmically Averaged Chowla and Sarnak Conjectures
- A remark on a conjecture of Borwein and Choi
- On a conjecture of Chowla and Walum
- An analogue to a conjecture of S. Chowla and H. Walum
This page was built for publication: On a conjecture of Chowla et al
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1273203)
