{
  "id": "1009.5360",
  "version": "v1",
  "published": "2010-09-27T19:09:41.000Z",
  "updated": "2010-09-27T19:09:41.000Z",
  "title": "Extremal orders of the Zeckendorf sum of digits of powers",
  "authors": [
    "Thomas Stoll"
  ],
  "comment": "11 pages",
  "categories": [
    "math.NT"
  ],
  "abstract": "Denote by s_F(n) the minimal number of Fibonacci numbers needed to write n as a sum of Fibonacci numbers. We obtain the extremal minimal and maximal orders of magnitude of s_F(n^h)/s_F(n) for any h>= 2. We use this to show that for all $>N_0(h) there is an n such that n is the sum of N Fibonacci numbers and n^h is the sum of at most 130 h^2 Fibonacci numbers. Moreover, we give upper and lower bounds on the number of n's with small and large values of s_F(n^h)/s_F(n). This extends a problem of Stolarsky to the Zeckendorf representation of powers, and it is in line with the classical investigation of finding perfect powers among the Fibonacci numbers and their finite sums.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2010-09-27T19:09:41.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "11B39",
      "11N56",
      "11A63"
    ],
    "keywords": [
      "fibonacci numbers",
      "extremal orders",
      "zeckendorf sum",
      "finite sums",
      "finding perfect powers"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 11,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2010arXiv1009.5360S"
    }
  }
}