<p>In this note, we deal with Stirling’s approximation to N!. We employ elementary mathematical techniques to provide an algorithm to calculate many terms of Stirling’s formula remainder. Our algorithm, based on a recursive scheme using polynomials, is an alternative to some methodologies already proposed in the literature.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

An algorithm for calculating terms of the Stirling’s formula remainder

  • Fabio Antonio Dorini,
  • Leyza Baldo Dorini

摘要

In this note, we deal with Stirling’s approximation to N!. We employ elementary mathematical techniques to provide an algorithm to calculate many terms of Stirling’s formula remainder. Our algorithm, based on a recursive scheme using polynomials, is an alternative to some methodologies already proposed in the literature.