Find upper and lower bounds for n/m

  • Thread starter Thread starter mathvision
  • Start date Start date
  • Tags Tags
    Bounds
Click For Summary
SUMMARY

The discussion focuses on finding upper and lower bounds for the ratio of factorials, specifically n!/m! where n>m>1. The established upper bound is given by {[(n+1)^(n+1)]/[(m+1)^(m+1)]}*e^(-(n-m)), and the lower bound is [(n^n)/(m^m)]*e^(-(n-m)). The derivation of these bounds utilizes Stirling's approximation, a crucial mathematical tool for approximating factorials.

PREREQUISITES
  • Understanding of factorial notation and properties
  • Familiarity with Stirling's approximation
  • Basic knowledge of limits and exponential functions
  • Concept of upper and lower bounds in mathematical analysis
NEXT STEPS
  • Study Stirling's approximation in detail
  • Explore advanced topics in asymptotic analysis
  • Learn about bounds in combinatorial mathematics
  • Investigate applications of factorial bounds in series convergence
USEFUL FOR

Mathematicians, students studying combinatorics, and anyone interested in advanced mathematical analysis and approximation techniques.

mathvision
Messages
5
Reaction score
0
If n>m>1, find upper and lower bounds for n!/m!

Answer: upper bound = {[(n+1)^(n+1)]/[(m+1)^(m+1)]}*e^(-(n-m))
lower bound = [(n^n)/(m^m)]*e^(-(n-m))

This is from a chapter on finding bounds for sum of series. Can someone please explain how to arrive at the answer? Thanks!
 
Physics news on Phys.org

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
1K
Replies
7
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
6
Views
3K
Replies
5
Views
2K
  • · Replies 17 ·
Replies
17
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K