Iteration of the number-theoretic function f(2n) = n, f(2n + 1) = 3n + 2
Iteration of the number-theoretic function f(2n) = n, f(2n + 1) = 3n + 2
复制标题
DOI：
10.1016/0001-8708(77)90087-1
复制
发表时间：
1977-07
影响因子：
1.7
通讯作者：
C. J. Everett
中科院分区：
文献类型：
--
作者：
C. J. Everett
Please try later.
ང It is trivial that m→{0, 0, 0,...} iff m= 0. Similarly m→{1, 0, 1, 0,…..} iff m= and hence the parity sequence for any m terminates in {xk, xk+ 1,...}={1, 0, 1, 0,...} iff mk fk (m) 1. Thus the above conjecture asserts that every parity sequence not the zero sequence terminates in 1, 0, 1, 0,.... If so, the list of parity sequences for m 1, 2,... in (3) would be rather remarkable, in view of the following property, which it does indeed have; namely the 2 parity sequences for the integers m< 2N