Approximation to an average of integer square roots

Click For Summary
SUMMARY

The discussion centers on an approximation for the average of integer square roots, expressed as \sum^{n}_{k=1}{\sqrt{k}/n} \approx \sqrt{median(1,2,...,n)}. The approximation exhibits a relative error of about 5% at n = 10000, which increases asymptotically as n approaches infinity. Additionally, the conversation touches on the implications of this approximation in relation to the equation Ʃ(tanh(x-sqrt(k))) = 0, revealing that the average of the square roots closely aligns with the numerically calculated minimum of Ʃ log(cosh(x-sqrt(k))). The discussion also references calculus concepts, particularly Riemann sums and limits.

PREREQUISITES
  • Understanding of calculus, specifically Riemann sums and limits
  • Familiarity with the properties of the hyperbolic tangent function
  • Knowledge of numerical methods for approximating integrals
  • Basic understanding of the zeta function and its applications
NEXT STEPS
  • Explore the derivation of Riemann sums and their applications in approximating integrals
  • Study the behavior of hyperbolic functions, particularly tanh, in mathematical analysis
  • Investigate the properties and applications of the zeta function, especially \zeta(-\frac{1}{2})
  • Learn about numerical methods for minimizing functions, including the use of logarithmic functions in optimization
USEFUL FOR

Mathematicians, calculus students, and anyone interested in numerical analysis and approximations of mathematical functions.

phasic
Messages
20
Reaction score
0
I have stumbled upon an approximation to the average of integer square roots.

\sum^{n}_{k=1}{\sqrt{k}/n} \approx \sqrt{median(1,2,...,n)}

Sorry I am not very good at LaTeX, but I hope this comes across okay. Could anyone explain why this might be happening?

In fact, I just discovered that the error increases in the shape of the sqrt function and is only off by about 4 at n = 10000, about a 5% error. Interestingly, this relative error is asymptotic as n tends towards infinity and may converge? If that were the case, this approximation will always have around 5% relative error...?

This had an interesting consequence on finding where Ʃ(tanh(x-sqrt(k))) = 0. It turns out if x is the average of the square roots up to n, since tanh is an odd function, the sum will be close to 0. Indeed, the approximate minimum at the average is close to the numerically calculated minimum of Ʃ log(cosh(x-sqrt(k)))

I hope this makes sense! Any thoughts are welcome.
 
Last edited:
Mathematics news on Phys.org
Do you know any calculus? That is related to something called a Riemann sum.
In calculus one learns that
$$\lim_{n \rightarrow \infty} \sum_{k=1}^n \sqrt{\frac{k}{n^3}}=\frac{2}{3}$$
So we can see that when n is large
$$\frac{1}{n} \sum_{k=1}^n \sqrt{k} \sim \frac{2}{3}\sqrt{n}$$
A more accurate approximation if you are interested is
$$\frac{1}{n} \sum_{k=1}^n \sqrt{k} \sim \frac{2}{3} \sqrt{n} - \frac{1}{2 \sqrt{n}}+\frac{1}{n} \zeta \left( -\frac{1}{2} \right) + \frac{1}{24n \sqrt{n}}$$
where
$$\zeta \left( -\frac{1}{2}\right) \sim -0.20788622497735456601730672539704930222626853128767253761011...$$
http://www.wolframalpha.com/input/?....**Integral.rangestart-.*Integral.rangeend---
 

Similar threads

Replies
12
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 0 ·
Replies
0
Views
1K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K