Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 20 min ago
PreprintarXiv licencearXiv

Three Quadratic Recurrences Modulo 3: What We Can Prove and What We Can Guess

Abstract

We study three innocent-looking recurrences modulo $3$, each built from squares of two earlier terms. One of them turns out to be secretly linear, and we can compute its periods exactly. One is a permutation hiding a small, perfectly orderly piece inside a large, random-looking one. The third looks thoroughly random, but it still has a few provable features. Along the way we meet open problems that need nothing beyond a first course in abstract algebra to state. This paper is a starting point, not the final word in any sense.

Related

  1. The distribution of αp modulo one in real quadratic function fields
    Esrafil Ali Molla
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  2. A quadratic-residue dichotomy for two partition functions modulo 3
    Jiyuan Li
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  3. The three Kanade-Russell identities modulo nine
    Yuma Mizuno
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  4. A proof of the Berkovich-Dhar conjecture modulo three
    Shutao Jiang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  5. Hidden Convexity of the Joint Range of Three Quadratic Forms and Applications
    Tuan Ngoc Hoang, Huy Quang Nguyen
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
BibTeX
@misc{finch2026three,
  title = {{Three Quadratic Recurrences Modulo 3: What We Can Prove and What We Can Guess}},
  author = {Steven Finch},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.34300},
  eprint = {2610.34300},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.34300},
}
RIS
TY  - UNPB
TI  - Three Quadratic Recurrences Modulo 3: What We Can Prove and What We Can Guess
AU  - Steven Finch
PY  - 2026
DA  - 2026/10/25
PB  - arXiv
DO  - 10.48550/arxiv.2610.34300
UR  - https://arxiv.org/abs/2610.34300
AB  - We study three innocent-looking recurrences modulo $3$, each built from squares of two earlier terms. One of them turns out to be secretly linear, and we can compute its periods exactly. One is a permutation hiding a small, perfectly orderly piece inside a large, random-looking one. The third looks thoroughly random, but it still has a few provable features. Along the way we meet open problems that need nothing beyond a first course in abstract algebra to state. This paper is a starting point, not the final word in any sense.
ER  -