{
  "id": "dickman-function-600806-f3f091156a46a206",
  "slug": "dickman-function",
  "title": "Dickman function",
  "qid": "Q5273760",
  "lead": ". In analytic number theory, the Dickman function or Dickman–de Bruijn function ρ is a special function used to estimate the proportion of smooth numbers up to a given bound. It was first studied by actuary , who defined it in his only mathematical publication. It was later studied by the Dutch mathematician Nicolaas Govert de Bruijn.",
  "body": ". In analytic number theory, the Dickman function or Dickman–de Bruijn function ρ is a special function used to estimate the proportion of smooth numbers up to a given bound. It was first studied by actuary , who defined it in his only mathematical publication. It was later studied by the Dutch mathematician Nicolaas Govert de Bruijn. ==Definition== The Dickman–de Bruijn function \\rho(u) is a continuous function that satisfies the delay differential equation u\\rho'(u) + \\rho(u-1) = 0\\, with initial conditions \\rho(u) = 1 for 0&nbsp;≤&nbsp;u&nbsp;≤&nbsp;1. \\Psi(N,B) \\approx N \\rho\\left(\\frac{\\log N}{\\log B}\\right). Ramaswami later gave a rigorous proof that for fixed a, \\Psi(x,x^{1/a}) was asymptotic to x \\rho(a) , with the error bound \\Psi(x,x^{1/a})=x\\rho(a)+O(x/\\log x) in big O notation. Knuth gives a proof for a narrowed bound: \\Psi(x,x^{1/a})=x\\rho(a)+(1-\\gamma)\\rho(a-1)(x/\\log x)+O(x/{(\\log x)}^2) where &gamma; is Euler's constant. ==Applications== The main purpose of the Dickman–de Bruijn function is to estimate the frequency of smooth numbers at a given size. This can be used to optimize various number-theoretical algorithms such as P–1 factoring and can be useful of its own right. It can be shown that \\Psi(x,y)=xu^{O(-u)} which is related to the estimate \\rho(u)\\approx u^{-u} below. The Golomb–Dickman constant has an alternate definition in terms of the Dickman–de Bruijn function. ==Estimation== A first approximation might be \\rho(u)\\approx u^{-u}.\\, A better estimate is \\rho(u)\\sim \\frac 1 {\\xi\\sqrt{2\\pi u}} \\cdot \\exp(-u\\xi+\\operatorname{Ei}(\\xi)) where Ei is the exponential integral and ξ is the positive root of e^\\xi-1=u\\xi.\\, A simple upper bound is \\rho(x)\\le1/x!. ==Computation== For each interval [n&nbsp;−&nbsp;1,&nbsp;n] with n an integer, there is an analytic function \\rho_n such that \\rho_n(u)=\\rho(u) . For 0&nbsp;≤&nbsp;u&nbsp;≤&nbsp;1, \\rho(u) = 1 . For 1&nbsp;≤&nbsp;u&nbsp;≤&nbsp;2, \\rho(u) = 1-\\log u . For 2&nbsp;≤&nbsp;u&nbsp;≤&nbsp;3, \\rho(u) = 1-(1-\\log(u-1))\\log(u) + \\operatorname{Li}_2(1 - u) + \\frac{\\pi^2}{12}. with Li 2 the dilogarithm. Other \\rho_n can be calculated using infinite series. An alternate method is computing lower and upper bounds with the trapezoidal rule; a mesh of progressively finer sizes allows for arbitrary accuracy. For high precision calculations (hundreds of digits), a recursive series expansion about the midpoints of the intervals is superior. Values for u&nbsp;≤&nbsp;7 can be usefully computed via numerical integration in ordinary double-precision floating-point. ==Extension== Friedlander defines a two-dimensional analog \\sigma(u,v) of \\rho(u) . This function is used to estimate a function \\Psi(x,y,z) similar to de Bruijn's, but counting the number of y-smooth integers with at most one prime factor greater than z. Then \\Psi(x,x^{1/a},x^{1/b})\\sim x\\sigma(b,a).\\, This class of numbers may be encountered in the two-stage variant of P-1 factoring. However, Kruppa's estimate of the probability of finding a factor by P-1 does not make use of this result. ==See also== Buchstab function, a function used similarly to estimate the number of rough numbers, whose convergence to e^{-\\gamma} is controlled by the Dickman function Golomb–Dickman constant Poisson-Dirichlet distribution ==References== ==Further reading==",
  "categories": [
    "10730570",
    "23603337",
    "26220375",
    "29176629"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1372858535",
  "content_hash": "f3f091156a46a206aef03e9c1c9f8eade399ad456031b469220db25572547c59",
  "created_at": 1792311292.417832,
  "updated_at": 1788360740.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "dickman-function-600806-f3f091156a46a206",
    "type": "webpage",
    "title": "Dickman function",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/dickman-function",
    "issued": {
      "date-parts": [
        [
          2026,
          10,
          18
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          19
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:dickman-function-600806-f3f091156a46a206",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1372858535",
    "note": "Immutable snapshot dickman-function-600806-f3f091156a46a206, content root f3f091156a46a206…"
  }
}