- Full text PDF available (4)
- This year (0)
- Last 5 years (1)
- Last 10 years (7)
Journals and Conferences
The Binary Reflected Gray Code function b is defined as follows: If m is a nonnegative integer, then b(m) is the integer obtained when initial zeros are omitted from the binary reflected Gray code of length m. This paper examines this Gray code function and its inverse and gives simple algorithms to generate both. It also simplifies Conder’s result that the… (More)
In this paper we discover an efficient method for answering two related questions involving the Stern–Brocot tree: What is the jth term in the nth level of the tree? andWhat is the exact position of the fraction s in the tree? © 2009 Elsevier Ltd. All rights reserved.
We discover a bijective map between the Gauss Map and the left-half of the Stern-Brocot Tree. The domain of the Gauss Map is then extended to cover all reals, and the coverage of the Stern-Brocot Tree is extended to include all positive and negative rationals in a manner that preserves the map between the two constructions.
A stable population, such that the total birthrate B(t) = Boerot, is abruptly altered by modifying the age-specific birth rate, m(x). The survivor function remains unaltered. The modified population ultimately settles down to a stable behavior, such that B(t) = B1er1t. It is shown that B1/Bo = (Ro-R1)/¿e1(ro-r1)RoZ1], where Ro, R1 are the net reproduction… (More)
Three equivalent methods of generating the paperfolding sequence are presented as well as a categorisation of runs of identical terms. We find all repeated subsequences, the largest repeated subsequences and the spacing of singles, doubles and triples throughout the sequence. The paperfolding sequence is shown to have links to the Binary Reflected Gray Code… (More)