On the period mod $m$ of polynomially-recursive sequences: a case study
From MaRDI portal
Publication:5236571
zbMath1460.11025arXiv1903.01986MaRDI QIDQ5236571
Publication date: 9 October 2019
Full work available at URL: https://arxiv.org/abs/1903.01986
supercongruencequadratic residueD-finite functionCarmichael functionWieferich primeP-recursive sequencemodular property
Exact enumeration problems, generating functions (05A15) Automata sequences (11B85) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Sequences (mod (m)) (11B50)
Related Items
Uses Software
Cites Work
- A method for determining the mod-\(2^k\) behaviour of recursive sequences, with applications to subgroup counting
- A short approach to Catalan numbers modulo \(2^r\)
- Symmetric functions and P-recursiveness
- A \(q\)-microscope for supercongruences
- On integrality and periodicity of the Motzkin numbers
- Congruences for Catalan and Motzkin numbers and related sequences
- Gaussian Hypergeometric series and supercongruences
- Carmichael's lambda function
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Right-jumps and pattern avoiding permutations
- Supercongruences for polynomial analogs of the Apéry numbers
- A case study in meta-automation: automatic generation of congruence automata for combinatorial sequences
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
