What is the value of n for greatest integer function to equal 2012?

  • Context: MHB 
  • Thread starter Thread starter juantheron
  • Start date Start date
  • Tags Tags
    Function Integer
Click For Summary
SUMMARY

The value of n for which the greatest integer function equals 2012 is determined by the equation $\displaystyle [\frac{n}{1!}]+[\frac{n}{2!}]+[\frac{n}{3!}]+...+[\frac{n}{10!}] = 2012$. The function f(n) is non-decreasing, with f(1000) < 2012 < f(2000). A binary search or bisection method can efficiently find the exact value of n within 10 iterations, given that the difference between 2000 and 1000 is less than 210.

PREREQUISITES
  • Understanding of the Greatest Integer Function
  • Familiarity with factorial notation and calculations
  • Knowledge of binary search algorithms
  • Basic proficiency in mathematical analysis
NEXT STEPS
  • Implement the binary search algorithm for function evaluation
  • Explore the properties of the Greatest Integer Function in depth
  • Study the convergence of series involving factorials
  • Practice solving similar equations involving non-decreasing functions
USEFUL FOR

Mathematicians, computer scientists, and students interested in numerical methods and algorithm optimization will benefit from this discussion.

juantheron
Messages
243
Reaction score
1
Calculate Natural no. $n$ for which $\displaystyle [\frac{n}{1!}]+[\frac{n}{2!}]+[\frac{n}{3!}]+...+[\frac{n}{10!}] = 2012$

where $[x] = $ Greatest Integer function
 
Mathematics news on Phys.org
The function $f(n)=\left\lfloor\dfrac{n}{1!}\right\rfloor+\dots+\left\lfloor\dfrac{n}{10!}\right\rfloor$ is non-decreasing and f(1000) < 2012 < f(2000). Since $2000-1000<2^{10}$, you can find n for which f(n) = 2012 in 10 iterations using binary search, or bisection method.
 

Similar threads

  • · Replies 13 ·
Replies
13
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 17 ·
Replies
17
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K