On the structure of the complement of the set of fibbinary numbers in the set of positive natural numbers

Abstract

The set of fibbinary numbers is defined via a bijection between the set N of natural numbers and . Since the elements of do not exhaust N, the structure of the complement of in N is of interest. An explicit expression =k ≥ 1∞ k is obtained in terms of certain well-defined sets k, \; k ≥ 1. 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 N 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…