On the structure of the complement $\overline{\Mfib}$ of the set $\Mfib$ of fibbinary numbers in the set of positive natural numbers
A.J.Macfarlane

TL;DR
This paper investigates the structure of the complement of fibbinary numbers within natural numbers, providing an explicit union-based expression and analyzing binary representations of odd numbers to understand their distribution.
Contribution
It introduces an explicit union expression for the complement of fibbinary numbers and develops a detailed binary representation analysis of odd numbers.
Findings
Explicit union expression for the complement of fibbinary numbers
Partitioning of natural numbers based on fibbinary structure
Binary representation analysis of odd numbers
Abstract
The set of fibbinary numbers is defined via a bijection between the set of natural numbers and . Since the elements of do not exhaust , the structure of the complement of in is of interest. An explicit expression is obtained in terms of certain well-defined sets . The key to its proof lies in first considering the odd numbers involved in this statement: a general treatment, with full justification, of the binary representations of the odd numbers is developed, and exploited in showing the expression quoted for to be correct. The main results of the article can also be viewed as providing partitions of the set of natural numbers, and also of its subset of odd numbers, that follow from the introduction of the set…
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
TopicsBenford’s Law and Fraud Detection · Computability, Logic, AI Algorithms
