Repeated concatenations in residue classes
Daniel Tsai

TL;DR
This paper presents an algorithm to identify repeated concatenations of natural numbers within residue classes, inspired by a sequence of v-palindromes, and explores potential generalizations and variations of this concept.
Contribution
The paper introduces a novel algorithm for detecting repeated concatenations in residue classes and generalizes a sequence of v-palindromes, expanding the scope of related investigations.
Findings
Algorithm successfully identifies repeated concatenations in residue classes.
Generalization of v-palindrome sequences broadens the scope of the study.
Discussion of potential variations suggests avenues for future research.
Abstract
We give an algorithm to determine all the repeated concatenations, in a given base, of a natural number in a residue class. The author recently describes a particular sequence of -palindromes that inspires this investigation. We also generalize this sequence and discuss how there could be variations of the investigation we do in this paper.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Coding theory and cryptography · Limits and Structures in Graph Theory
