No label defined (Q5797130)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3057976
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3057976 |
Statements
1950
0 references
Number theory
0 references
The following problem suggested by the reviewer is treated: There are to be found all \glqq bases\grqq{} for the set of integers i.e. all sets \( \left\{b_{0}, b_{1}, \ldots\right\} \) of integers giving an arbitrary integer \( x \) in a uniquely determined expansion \( x=\sum_{i=0}^{\infty} \varepsilon_{i} b_{i}\left(\varepsilon_{i}=0\right. \) or \( \left.1, \sum_{i=0}^{\infty} \varepsilon_{i}<\infty\right) \). A characteristic example is \( b_{i}=(-2)^{i}(i=0,1, \ldots) \). The author proves first the conjecture of the reviewer by which every base has the form \( \left\{d_{0}, 2 d_{1}, 2^{2} d_{2}, \ldots\right\} \) where the \( d_{2} \) are odd numbers. A sequence \( \left[d_{0}, d_{1}, \ldots\right] \) of odd numbers is called a ``basic sequence'' whenever \( \left\{d_{0}, 2 d_{1}, 2^{2} d_{2}, \ldots\right\} \) is a base. The author gives some necessary and some sufficient conditions for a sequence to be basic. The main result of the paper is an algorithm which enables one to decide in a finite number of steps whether a periodic sequence \( \left[d_{0}, d_{1}, \ldots\right]\left(d_{i+s}=d_{i}\right. \) for some \( s>0 \) and all \( i \) ) is or is not basic. Further a more detailed discussion of the case \( s=2 \) is given i. e. the basic sequences \( [a, b, a, b, \ldots]=[a, b] \) are studied. For instance, the sequence \( [13,-7] \) is shown to be basic, which disproves the further conjecture of the reviewer according to which any basic sequence contains \(\pm 1\) infinitely often. The author shows that there are infinitely many basic sequences of the periode 2, for instance \( \left[2^{2 k+1}-1,-1\right] \) is basic for every \( k \geq 0 \). There is also a complete list given of all basic sequences \( [a, b] \) as far as \( 100 \geqq a>-b>0 \). An especially important result of the paper is that from any arbitrary sequence of odd numbers one can make a basic sequence, by interpolation of sufficiently long sequences of terms 1 or -1 at infinitely many places. Finally some generalizations. and some interesting related conjectures on finite abelian groups are discussed.
0 references