On Pascal triangles modulo a prime power

DOI10.1016/S0168-0072(97)85376-6zbMath0889.11008OpenAlexW2014920673MaRDI QIDQ1377632

Alexis Bès

Publication date: 22 June 1998

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-0072(97)85376-6

zbMATH Keywords

decidabilitybinomial coefficientLucas' theoremfirst-order definable additionPascal triangle modulo \(n\)

Mathematics Subject Classification ID

Binomial coefficients; factorials; (q)-identities (11B65) Decidability (number-theoretic aspects) (11U05) Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30)

Related Items (4)

Some new results in monadic second-order arithmetic ⋮ Theories of generalized Pascal triangles ⋮ A list of arithmetical structures complete with respect to the first-order definability ⋮ Theories of arithmetics in finite models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: On Pascal triangles modulo a prime power