On Pascal triangles modulo a prime power

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

Review text

For every integer \(n\geq 1\), the Pascal triangle modulo \(n\) is the binary function \(B_n\) on \(\mathbb{N}^2\) defined by \[ B_n(x,y) =\text{Rem} \left( {x+y \choose x},n \right), \] where \(\text{Rem}(a,b)\) denotes the remainder by integer division of \(a\) by \(b\), and ( ) is the binomial coefficient. In the first part of this paper, the author studies arithmetical properties of Pascal triangles modulo a prime power; the main result is the generalization of Lucas' theorem. Then he investigates the structure \(\langle \mathbb{N}; B_{p^\alpha} \rangle\), where \(p\) is a prime and \(\alpha\) is an integer greater than one. It is also shown that addition is first-order definable in this structure, and that its elementary theory is decidable.

Cites work

Cited in

(19)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1377632)