Metraipolis › archive › dc_6399736682ac
Pascal tiling and congruences modulo N in Pascal's triangle — arXiv:2609.08343
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.08343
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T14:49:26.404Z
- SHA-256 of the archived text
4ff43e7d8812e7fbcc1be33793fad429563a1cc83d49144dbbda839bafb2128a- Stable URL of this page
https://metraipolis.com/documento/dc_6399736682ac
How to cite
Pascal tiling and congruences modulo N in Pascal's triangle — arXiv:2609.08343 — arXiv (en), https://arxiv.org/abs/2609.08343 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6399736682ac (Metraipolis archive dc_6399736682ac, sha256 4ff43e7d8812e7fbcc1be33793fad429563a1cc83d49144dbbda839bafb2128a)
BibTeX
@misc{dc6399736682ac,
title = {Pascal tiling and congruences modulo N in Pascal's triangle — arXiv:2609.08343},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.08343},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6399736682ac; sha256 4ff43e7d8812e7fbcc1be33793fad429563a1cc83d49144dbbda839bafb2128a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.08343. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We investigate the properties of matrices obtained from a geometric transformation of the first $N$ rows of Pascal's triangle. For $N > 2$, their congruence properties form a \emph{Pascal tiling}, that is, a perfect alternation between entries congruent to $0 \pmod{N}$ and the others, if and only if $N$ is prime. This result yields an alternative proof of the classical congruence $L_N-1\equiv 0 \pmod{N}$ for prime $N$, where $L_N$ denotes the $N$th Lucas number. Within the framework of the \emph{Pascal tiling theorem}, this congruence can be expressed as a sum of entries lying along a diagonal of one of the matrices under consideration; when $N$ is prime, each of these entries is congruent to $0 \pmod{N}$. By contrast, for Fibonacci pseudoprimes, the sum remains congruent to $0 \pmod{N}$ while at least one of its terms is not. Finally, these results are interpreted in terms of decompositions of binomial coefficients and extended to multinomial coefficients, leading to a study of the associated symmetries. This perspective highlights the case where $N$ is a prime power and clarifies the conditions under which a Pascal tiling arises.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.CO).
Categorie arXiv: Number Theory (math.NT) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.08343 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T14:32:29.942Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).