Hostname: page-component-586b7cd67f-vdxz6 Total loading time: 0 Render date: 2024-11-28T10:41:23.034Z Has data issue: false hasContentIssue false
  • English
  • Français

85.41 Sharper bounds for the factorial of n

Published online by Cambridge University Press:  01 August 2016

Phillip Edwards  and
Munir Mahmood
Phillip Edwards
Affiliation:
Department of Econometrics and Business Statistics, Monash University Clayton, Victoria 3168, Australia
Munir Mahmood
Affiliation:
Department of Econometrics and Business Statistics, Monash University Clayton, Victoria 3168, Australia
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Notes
Information
The Mathematical Gazette , Volume 85 , Issue 503 , July 2001 , pp. 301 - 304
Copyright
Copyright © The Mathematical Association 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Mahmood, M. Edwards, Phillip and Singh, Sarjinder Bounds for (kn)! and the factorial polynomial, Math. Gaz. 83 (March 1999) pp. 111–113.Google Scholar