{
  "id": "2308.02567",
  "version": "v1",
  "published": "2023-08-03T07:47:31.000Z",
  "updated": "2023-08-03T07:47:31.000Z",
  "title": "Introduction to polynomial continued fractions",
  "authors": [
    "Ofir David"
  ],
  "comment": "arXiv admin note: substantial text overlap with arXiv:2303.09318",
  "categories": [
    "math.DS",
    "math.NT"
  ],
  "abstract": "The simple continued fraction expansion is a basic and powerful tool in number theory. However, finding the actual coefficients in the expansion is usually quite hard, since we need to compute each coefficient one after the other using the generalized Euclidean division algorithm. In this note we introduce the polynomial continued fraction expansion, which while lacks some of the interesting properties the simple continued fraction expansions have, in return we gain much simpler formulas and easier computation which lead by themselves to other interesting results.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2023-08-03T07:47:31.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "11J70",
      "11J72",
      "40A15"
    ],
    "keywords": [
      "simple continued fraction expansion",
      "introduction",
      "polynomial continued fraction expansion",
      "generalized euclidean division algorithm",
      "actual coefficients"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}