4,928 research outputs found

    On a problem of Pillai with k-generalized Fibonacci numbers and powers of 2

    No full text
    For an integer k≥2 k\geq 2 , let {Fn(k)}n≥0 \{F^{(k)}_{n} \}_{n\geq 0} be the k k--generalized Fibonacci sequence which starts with 0,…,0,1 0, \ldots, 0, 1 (k k terms) and each term afterwards is the sum of the kk preceding terms. In this paper, we find all integers cc having at least two presentations as a difference between a kk--generalized Fibonacci number and a powers of 2 for any fixed k⩾4k \geqslant 4. This paper extends previous work from [9] for the case k=2k=2 and [6] for the case k=3k=3
    • …
    corecore