Skip to main content
edited title
Link
kodlu
  • 10.4k
  • 2
  • 36
  • 55

Tight upper bound on $\sum_{1\leq k\leq m} \sqrt{(n/xk)+b}$

Source Link
kodlu
  • 10.4k
  • 2
  • 36
  • 55

Tight upper bound on $\sum_{1\leq k\leq m} \sqrt{(n/x)+b}$

I apologise if this is obvious or off-topic.

Let $n$ be large and fixed, $b>0,$ and $m \in [\log n,n),$ say. This sum seems to be hard to evaluate/upper bound analytically (in closed form). Approximating by integration is tricky. To use a $u-$substitution for teh quantity inside the square root, would mean that the estimated integral would have an extra logarithm which would mean the bound wouldn't be so great. Mathematica (via Wolfram Alpha) gives (after factoring out $\sqrt{n}$):

this

but the problem here is that the inverse hyperbolic tangent blows up if its argument is strictly bigger than 1.

It doesn't help that all my books, including Gradsteyn-Rhzik are at work, and so is my licenced copy of Mathematica--off limits due to COVID-19.

Any comments, suggestions appreciated. Maybe there is something obvious I haven't seen.