No label defined (Q4936039)

Let \[ D(x_1, x_2,\dots, x_n)= (|x_1-x_2|, |x_2-x_3|,\dots, |x_n-x_1|) \quad (x_i\in \mathbb{Z}). \] Ducci-sequences are sequences of \(n\)-tuples \(u_0, u_1,\dots\), generated by the relation \(u_{k+1}= Du_k\). It has been shown that every Ducci-sequence reduces to a sequence of binary tuples \(u_k= (x_1,\dots, x_n)\), \(x_i\in \{0,c\}\) for some \(i\) and some constant \(c\) (it is sufficient to take \(c=1\)). If \(u_0= (0,0,\dots, 0,1)\), then the Ducci-sequence is called basic. In the paper under review the author generalizes two results of \textit{H. Glaser} and \textit{G. Schöffl} [Fibonacci Q. 33, 313-324 (1995; Zbl 0830.11005)]. Namely, he shows how Pascal's triangle can be used to construct any tuple in the basic Ducci-sequence that is part of the basic Ducci cycle. Two errors which occur in a paper by Glaser and Schöffl are corrected.