On Pascal triangles modulo a prime power
From MaRDI portal
Publication:1377632
DOI10.1016/S0168-0072(97)85376-6zbMath0889.11008MaRDI QIDQ1377632
Publication date: 22 June 1998
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
decidability; binomial coefficient; Lucas' theorem; first-order definable addition; Pascal triangle modulo \(n\)
11B65: Binomial coefficients; factorials; (q)-identities
11U05: Decidability (number-theoretic aspects)
03B25: Decidability of theories and sets of sentences
03F30: First-order arithmetic and fragments
Related Items
A list of arithmetical structures complete with respect to the first-order definability, Theories of generalized Pascal triangles, Some new results in monadic second-order arithmetic, Theories of arithmetics in finite models
Cites Work
- Two \(p^ 3\) variations of Lucas' theorem
- A binomial coefficient congruence modulo prime powers
- Logic and \(p\)-recognizable sets of integers
- Theories of generalized Pascal triangles
- Weak Second‐Order Arithmetic and Finite Automata
- A Generalization of a Congruential Property of Lucas
- Unnamed Item
- Unnamed Item
- Unnamed Item