this is for holding javascript data
Dayo Ogundipe deleted paragraph_Question_2_a_Show__.tex
over 8 years ago
Commit id: b3468043db2517dc9fe0601dfadcec7b3c075212
deletions | additions
diff --git a/layout.md b/layout.md
index dcfd2cb..7600c2c 100644
--- a/layout.md
+++ b/layout.md
...
untitled.tex
figures/Untitled-2/Untitled-2.png
paragraph_Question_2_a_Show__.tex
paragraph_Question_3_a_Is__.tex
figures/Untitled-4/Untitled-4.png
paragraph_c_Calculate_and_plot__.tex
diff --git a/paragraph_Question_2_a_Show__.tex b/paragraph_Question_2_a_Show__.tex
deleted file mode 100644
index e2833aa..0000000
--- a/paragraph_Question_2_a_Show__.tex
+++ /dev/null
...
\paragraph{Question 2(a)}
Show that the sequence $x(n)=\frac{1}{n}+\frac{1}{n+1}+\ldots +\frac{1}{2n}$ is monotone decreasing and bounded below and therefore convergent.
x(n) is monotone decreasing if $x(n+1)\leq x(n)$ for all $n\geq 1$.
\[ x(n+1) = \frac{1}{n+1}+\frac{1}{n+2}+\ldots +\frac{1}{2n+1} \]
Since \[ \frac{1}{n} > \frac{1}{n+1} \] for $n \geq 1$
\\x(n) naturally starts off greater. The denominator of the fraction being added increases for each x(n) and x(n+1) so the sequence converges.
\\ $\therefore x(n)=\frac{1}{n}+\frac{1}{n+1}+\ldots +\frac{1}{2n} > x(n+1) = \frac{1}{n+1}+\frac{1}{n+2}+\ldots +\frac{1}{2n+1}$ and is monotone decreasing.
\\ The sequence x(n) is bounded below if there is a real number L such that $x(n)\geq L$ for all $n\geq 1$.
Lets say L = 2 then $x(n) \geq 1$ for all $n\geq 1$.
\\When n = 1.
\[\frac{1}{1} = 1+..+\]
Then we add positive rational numbers that are less than 1 so the sum is less than 2.
\\As n increases, n=1 is greater than any other n because $\frac{1}{n}$ the n is in the denominator.
\\ $\therefore$ there is a real number L such that $x(n)\geq L$ for all $n\geq 1$.
\paragraph{(b)} Calculate and plot x(n) for $1\leq n \leq 1000$ and estimate $\lim_{n\to \infty}x(n)$.