Tagged Questions

3answers
41 views

Series evaluated to $m$ terms, approximating the error

Given a series $\displaystyle\sum_{n=0}^\infty a_n$, how can we bound the error (which I shall denote with $R_n$) when we evaluate it to $m$ terms? $$\sum_{n=0}^\infty a_n \approx \sum_{n=0}^m a_n$$ ...
0answers
53 views

Expansion in powers

Let $n=2k, k \in Z_+$. Let P_k\left(\frac{t}{\sqrt n}\right)=n!\sum_{\begin{smallmatrix} n_1+\ldots+n_k=n \\ ...
0answers
35 views

alternating series estimation with integral?

We know that there are some approximation like Abel's identity. If $\lambda_n$ is increasing and $$C(x)=\sum_{\lambda_n\le x}c_n,\qquad(c_n\in\mathbb{C})$$ Then if $X\ge\lambda_1$ and $\phi(x)$ has ...
0answers
45 views

How can weakly/strongly decreasing or increasing approximate sums be explained?

I'm reading around big O to get some concept about performance for data structures. The mathematics book recommended by the open book ~ maths for computer science In the book (pg 456) part of the ...
0answers
44 views

Intuition for approximating Ei(x)

I'm working with a function that is defined to be the sum of a series, and I'd like to either find its values, or approximate them analytically: \$F(x) = \frac{1}{w} ...
1answer
159 views

Approximating a weird sum

How can I approximate the sum$$\sum_{k=1}^n \left(\frac{2k}{n} \left\lceil \frac{n}{k} \right\rceil \left\{ \frac{n}{k} \right\}-1\right)$$ where $\{x\}$ is the fractional part function, and \$\lceil ...
1answer
42 views

Prove that s is finite and find an n so large that $S_n$ approximate s to three decimal places.

$$S=\sum_{k=1}^\infty\left(\frac{k}{k+1}\right)^{k^2};\hspace{10pt}S_n=\sum_{k=1}^n\left(\frac{k}{k+1}\right)^{k^2}$$ Let $S_n$ represent its partial sums and let $S$ represent its value. Prove that ...
1answer
143 views

Is this sequence convergent?

I heard this question from a professor a couple years ago. I still think about it... Does the sequence $(a_n)_{n\in \mathbb N}$ with $$a_n=\sqrt[n]{|\sin(n)|}$$ converges ( to $1$ ) ? I believe ...
1answer
70 views

Approximating a simple sum

Can somone help me find an assymptotic formula for n, for fixed x , for this sum , perhaps an inequality would be even better, or some bound on the error. $$\sum_{k=1}^n \frac{1}{\log(kx)}$$ I need ...
0answers
58 views

Rapidly convergent series for $\sum_{J=0}^{\infty} (2 J + 1) e^{-\beta J(J+1)}$ (rigid rotor)

I need to evaluate this series for arbitrary $\beta > 0$: $Q = \sum_{J=0}^{\infty} (2 J + 1) e^{-\beta J(J+1)}$ Is it related to a known transcendental function? From the research I did, it ...
1answer
34 views

How to approximate a complex linear homogenous recurrence with constant coefficients with a simple one?

Is there some standard way to approximate a complex linear homogenous recurrence with constant coefficients with a simple one? For example, I might want to approximate  ...
2answers
254 views

Summation of divergent series of Euler: $0!-1!+2!-3!+\cdots$

Consider the series $$\sum\limits_{k=0}^\infty (-1)^kk!x^k\in\mathbb{R}[[x]]$$ Let $s_n(x)$ be partial sum. And let $\omega_{k,n}=(k!^2(n-k)!)^{-1}$. My question is: Prove that ...
0answers
58 views

proof of one inequality with sums

Please help me to prove the following inequality: Fix $k, m \in Z_+$ and for $j \in Z_+$ set \begin{align*} a_j^{(1)}=a_j=\sum_{i=0}^{\min\{j,k\}}\frac{1}{i!6^i}\frac{(-1)^{j-i}}{(2(j-i)+1)!} ...
1answer
156 views

Using binomial theorem find general formula for the coefficients

Using binomial thaorem (http://en.wikipedia.org/wiki/Binomial_theorem) find the general formula for the coefficients of the expantion:  ...
1answer
233 views

Approximating the logarithm of sum

I would like to approximate $$\ln(\sum_{k=0}^n(n-2k)^p)$$ Here $p\geq 2$
0answers
106 views

Calculation of sum

I am wondering if it is possible to calculate or approximate the following sum $$\sum_{k=0}^l\frac{(l-2k)^p(2l+k(k-1))l^{k-1}}{(k+3)(k+2)}$$here $p \geq 2$. Thank you.
0answers
240 views

Calculation of  a 'double'  sum

Let $n \in N$ and $q\geq 2$. I am trying to calculate the following sum: $$\sum_{i=0}^{\sqrt n/2}\sum_{j= i \sqrt n }^{(i+1)\sqrt n}\frac{(-1)^q2^q(\frac{n}{2}-j)^q}{(n-j)!j!}$$ Any help will be ...
1answer
126 views

Best and most efficient way to numerically compute $e$?

There are many well-known methods for efficiently numerically computing $\pi$, such as Chudnovsky's Method or perhaps Gauss-Legendre's algorithm. I was wondering what the best method for computing $e$ ...
1answer
178 views

Newton-Raphson's Method to find $\sqrt{2012}$

I am asked to find $\sqrt{2012}$ using Newton-Raphson's Method with the following recursive method $$x_{n+1} = \frac{1}{2} (x_n + \frac{a}{x_n})$$ I notied that give same answers as using ...
2answers
308 views

How to bound the truncation error for a Taylor polynomial approximation of $\tan(x)$

I am playing with Taylor series! I want to go beyond the basic text book examples ($\sin(x)$, $\cos(x)$, $\exp(x)$, $\ln(x)$, etc.) and try something different to improve my understanding. So I ...
4answers
198 views

How could we manually approximate $\sum_{i=1}^{50} i! = 3.1035 \times 10^{64}$?

How could we manually approximate $$\sum_{i=1}^{50} i!$$ to the value $3.1035 \times 10^{64}$? I faced this question in my aptitude test,there were four option given,I couldn't solve it during ...
1answer
356 views

A series problem by Knuth

I came across the following problem, known as Knuth's Series which originally was an American Mathematical Monthly problem. Prove that \sum_{n=1}^\infty ...
2answers
131 views

Find fast exact value for numbers in the form $\sum_{k=min}^{Max}\frac{1}{k}$

I know I could start multiplying by all denominators and try to get the exact value that way but is there some smarter way or shortcut? Let's take simple example: \$\displaystyle ...
3answers
343 views

$\lim_{n\to\infty} f(2^n)$ for some very slowly increasing function $f(n)$

I should be able to answer this myself, but feel insecure anyway. I want to know, whether a function f(n) is bounded if n goes to infinity (and if it's bounded, the limit). Heuristically it appears ...
3answers
2k views

Motivation for Ramanujan's mysterious $\pi$ formula

The following formula for $\pi$ was discovered by Ramanujan: $$\frac1{\pi} = \frac{2\sqrt{2}}{9801} \sum_{k=0}^\infty \frac{(4k)!(1103+26390k)}{(k!)^4 396^{4k}}\!$$ Does anyone know how it works, or ...
3answers
178 views

Determine speed of the object at the current time by the non-uniform time sample

Here is a time sample: $Q = \{(t_i, x_i) | 0 \leq x_i \leq x_{i+1}, 1 \leq i \leq n\}$ and rules: (1) $T_1 \leq t_{i+1} - t_i < T_2$ where $T_1, T_2 > 0$ (2) $x_i$ comes with error: \$x_i = ...
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 51, "mathjax_display_tex": 13, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.3, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9124069213867188, "perplexity_flag": "middle"}