Picard sequences with every orbit containing infinitely many perfect \(n\)-powers (Q999717)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Picard sequences with every orbit containing infinitely many perfect \(n\)-powers
scientific article

    Statements

    Picard sequences with every orbit containing infinitely many perfect \(n\)-powers (English)
    0 references
    0 references
    10 February 2009
    0 references
    Let \(f\) be a function on the set of the natural numbers \(\mathbb N\). The sequence \(z,\) \(f(z),\) \(f(f(z)),\) \(f(f(f(z))),...\) is called Picard sequence associated with \(f\). If \(z\) is any point in the domain of \(f\), then the above sequence is called the orbit of \(z\) associated to Picard sequence. Let \(a\in\mathbb N\) be fixed and let \(f_a(z) = z + a\) for any natural number \(z\). The Picard sequence associated with \(f_a\) is \[ \{f_a^{(j)}(z)\mid j \geq 0, \;f_a^{(0)}(z) = z, \;f_a^{(j)}(z) = z + ja \}. \] In the paper the following two theorems are proved. \textbf{Theorem 1.} Let \(n \geq 2\) and \(n\in\mathbb N\). Let \(f_1: \mathbb N\to \mathbb N\) be defined by \[ f_1(a) = a + \lfloor {\root n\of a} \rfloor, \] where \(\lfloor b \rfloor\) denotes the greatest integer smaller than or equal to the absolute value of \(b\). Then the sequence of natural numbers \[ \{f_1^{(i)}(s)\mid i \geq 0, \;s := f_1^{(0)}(s), \;f_1^{(i+1)}(s) = f_1(f_1^{(i)}(s)) \} \] contains infinitely many perfect \(n\)-powers for all natural numbers \(s\). \textbf{Theorem 2.} Let \(n\geq 2\) and \(n\in\mathbb N\). Let \(f_s: \mathbb N\to\mathbb N\) be defined by \[ f_1(a) = a + \lceil {\root n\of a} \rceil, \] where \(\lceil b \rceil\) denotes the smallest integer greater than or equal to the absolute value of \(b\). Then the sequence of natural numbers \[ \{f_2^{(i)}(s)\mid i \geq 0, \;s := f_2^{(0)}(s), \;f_2^{(i+1)}(s) = f_2(f_2^{(i)}(s)) \} \] contains infinitely many perfect \(n\)-powers for all natural numbers \(s\) if and only if \(n\) is odd.
    0 references
    0 references
    0 references

    Identifiers