Long Solutions of Sequence A348480 of the On-Line Encyclopedia of Integer Sequences
R\"udiger Jehn

TL;DR
This paper investigates special binary solutions related to sequence A348480, focusing on long solutions where the binary number contains many zeros, and provides proofs for certain cases.
Contribution
It presents proofs that numbers 7 and 13 have long solutions, expanding understanding of binary solutions in sequence A348480.
Findings
Numbers 11 and 37 have long solutions due to their porosity.
Proofs for the existence of long solutions for 7 and 13 are provided.
Most minimal solutions contain few zeros, unlike long solutions.
Abstract
For numbers coprime to there exist infinitely many binary numbers such that the greatest common divisor of and rev() = and the sum of digits of (rev() is the digit reversal of ). In most cases, the smallest that fulfill these two constraints contain just a few zeros. But in some cases like for and , must contain more zeros than ones and these are called long solutions. For and it follows directly from the fact that these are porous numbers. For and , the proofs that they have long solutions are presented 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
TopicsComputability, Logic, AI Algorithms · Benford’s Law and Fraud Detection
