Decomposition of Pascal's kernels mod .
Definability within structures related to Pascal’s triangle modulo an integer
Let Sq denote the set of squares, and let be the squaring function restricted to powers of n; let ⊥ denote the coprimeness relation. Let . For every integer n ≥ 2 addition and multiplication are definable in the structures ⟨ℕ; Bn,⊥⟩ and ⟨ℕ; Bn,Sq⟩; thus their elementary theories are undecidable. On the other hand, for every prime p the elementary theory of ⟨ℕ; Bp,SQp⟩ is decidable.
Deformations of the Taylor formula.
Démonstration «automatique» d'identités et fonctions hypergéométriques
Determinant expressions for -harmonic congruences and degenerate Bernoulli numbers.
Dixon's formula and identities involving harmonic numbers.
Důkaz jedné věty o binomických součinitelích pomocí počtu pravděpodobnosti