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 , and of its subset of odd integers.

生成讲解博客的中文版本

生成AI智能校验的中文版本