PASCALIAN RECTANGLES MODULOm
From MaRDI portal
Publication:3984680
A recursive technique is developed for optimizing the sums \(V^ n_{m,k}=\sum_{j\equiv k\bmod(m)}{n\choose j}\). This yields two new proofs of the Ramus formula \[ V^ n_{m,k}={1\over m}\sum_{0\leq j<m}\bigl(2\cos{\pi j\over m}\bigr)^ n\cos{j(n-2k)\pi\over m}. \] These sums have applications in the study of fault tolerance in the hypercube computer.
Recommendations
- scientific article; zbMATH DE number 4139309
- On Pascal's triangle modulo p²
- Circles and squares modulo p
- On Pascal triangles modulo a prime power
- Lucas triangles modulo \(p\)
- Rows of Pascal's triangle modulo a prime
- Moduli of Poncelet polygons.
- Magic rectangles and modular magic rectangles
- Symmetric Pascal matrices modulo \(p\)
- scientific article; zbMATH DE number 4210226
Cites work
This page was built for publication: PASCALIAN RECTANGLES MODULOm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3984680)