Keith P. Tognetti

Learn More
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)
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)