Sunday, 2 October 2016

Prove the convergence of $prodlimits^{n}_{k=1}{left(1+frac{k}{n^p}right)} $ and Find Its Limit




Suppose $p> 1$ and the sequence $\{x_n\}_{n=1}^{\infty}$ has a general term of
$$x_n=\prod\limits^{n}_{k=1}{\left(1+\frac{k}{n^p}\right)} \space\space\space\space\space\space\space\space\space\space\space\space\space\space\space\space n=1,2,3, \cdots$$

Show that the sequence $\{x_n\}_{n=1}^{\infty}$ converges, and hence find
$$\lim_{n\rightarrow\infty}{x_n}$$
which is related to $p$ itself.




I have been attempted to find the convergence of the sequence using ratio test but failed. The general term has a form of alike the $p$-series. And also the question seems difficult to find its limit because the denominator is of $p^{th}$ power. How do I deal it?


Answer



We have that



$$\prod\limits^{n}_{k=1}{\left(1+\frac{k}{n^p}\right)}=e^{\sum^{n}_{k=1}{\log \left(1+\frac{k}{n^p}\right)}}$$




and



$$\sum^{n}_{k=1}{\log \left(1+\frac{k}{n^p}\right)}=\sum^{n}_{k=1} \left(\frac{k}{n^p}+O\left(\frac{k^2}{n^{2p}}\right)\right)=$$$$=\frac{n(n-1)}{2n^{p}}+O\left(\frac{n^3}{n^{2p}}\right)=\frac{1}{2n^{p-2}}+O\left(\frac{1}{n^{2p-3}}\right)$$



therefore the sequence converges for $p\ge 2$




  • for $p=2 \implies x_n \to \sqrt e$

  • for $p>2 \implies x_n \to 1$




and diverges for $1.



Refer also to the related




real analysis - $f(nx)to 0$ as $nto+infty$



Let $f:\mathbb R^+\to\mathbb R^+$ be a continuous function, and let $I$ be a subset of $\mathbb R^+$ such that the following property holds:





For any $x\in I$, $f(nx)\to 0$ as $n\to+\infty$.




Intuitively, if $I$ is 'big' enough, $f$ necessarily tends to $0$ at infinity, but it happens to not always be the case. I am investigating whether it can be said, for various $I$, if




$f(x)\to 0$ as $x\to+\infty$.








As a first example, consider $I=[0,1]$. Set $\varepsilon>0$, and consider the closed sets $F_n=\{x\in I\mid f(kx)<\varepsilon,\forall k\geq n\}$. Their union is $[0,1]$, and thus, thanks to the property of Baire, one of them has non-empty interior, i.e. $[a,b]\in F_n$ for a certain $n$. It follows that for all $k\geq n$ and $x\in[ka,kb]$, $f(x)<\varepsilon$. But since $b>a$, $\bigcup_{k=n}^\infty [ka,kb]$ contains a half-line, and $\limsup_{x\to\infty} f(x) \leq \varepsilon$. Since the reasoning holds for any $\varepsilon>0$, we conclude that $f$ does, indeed, tend to $0$ at infinity. The same proof actually works for all $I$ with non-empty interior.



The result is false in higher dimensions when $I$ contains a neighbourhood of the origin, as a simple counter-example can be constructed using a parabola.



What happens when $I\subset \mathbb R$ is smaller? Consider the following sets:




  1. $I$ is any measurable set with empty interior, but with Lebesgue measure >0. In that case, one of the aforementioned $F_n$ has positive Lebesgue measure.



  2. $I=(0,1)\cap C$, where $C$ is the Cantor set (or another uncountable set). Then, one of the $F_n$ has to be uncountable aswell,


  3. $I=\{1/k,k\in\mathbb N\}$ or $I=(0,1)\cap \mathbb Q$, both of these being equivalent. I provided an answer below for this one, and actually for any countable set; such a function $f$ does not necessarily converge to $0$.




In any of these cases, can anything be said about the behaviour of $f$ at infinity?



Bonus question: what is the minimum condition for $I$ (if there is one) so that $f$ has to converge to $0$?







I thought about mimicking the proof of the first example when $I$ has empty interior but positive Lebesgue measure. If there exists an integer $n$ and a non-trivial interval $[a,b]$ such that $|F_n\cap [a,b]|=b-a$, then $f\leq\varepsilon$ on a set that is dense on a half-line, and thus, using continuity, tends to $0$. Sadly, such an interval may not exist, since the closure of $F_n$ could very well be of empty interior, like a generalized Cantor set.


Answer



At the first I remark that your proof works for all non-meager $I$ (that is which are not a countable union of nowhere dense sets). From the other hand, let $I$ be a meager subset of $\mathbb R^+$. Choose a sequence $\{F_n\}$ of closed nowhere dense sets such that $F_n\subset [1/n;n]$ for each $n$ and $\bigcup F_n\cup \{0\}\supset I$. The family $\mathcal F=\{mF_n:m\ge n^2\}$ is locally finite, so a set $F=\bigcup\mathcal F$ is closed. Since the set $F$ is meager, by Baire theorem, it does not contain a half-line. This means there exists a sequence $S=\{x_n\}\subset\mathbb R^+\setminus\{0\}$ which goes to infinity. Thus the set $S$ is closed. Since the closed sets $F\cup\{0\}$ and $S$ are disjoint and the space $\mathbb R^+$ is normal, there exists a continuous function $f: \mathbb R^+\to \mathbb R^+$ such that $f(F\cup\{0\})=0$ and $f(S)=1$. Therefore there exists arbitrary large $x$ such that $f(x)=1$, but for each $x\in I$ $f(nx)$ eventually gets $0$.


Saturday, 1 October 2016

linear algebra - Determinant of block matrix as determinant of smaller matrix




I am considering block matrices $$\begin{pmatrix} A & v \\ v^T & x \end{pmatrix}$$ with $A \in \mathbb{R}^{(n-1) \times (n-1)}$, $v \in \mathbb{R}^{n-1}$, $x \in \mathbb{R}.$ Is there a rational $(n-1) \times (n-1)$ expression $p(A,v,x)$ I can form in the variables $A,v,x$ such that $$\mathrm{det}\begin{pmatrix} A & v \\ v^T & x \end{pmatrix} = \mathrm{det}(p(A,v,x))\; ?$$



The first thing I tried is the block matrix formula $$\mathrm{det}\begin{pmatrix} A & v \\ v^T & x \end{pmatrix} = x \, \mathrm{det}\Big(A - \frac{1}{x}vv^T \Big).$$ However writing this as just an $(n-1) \times (n-1)$ determinant introduces strange exponents: $$\mathrm{det}\Big( x^{1/(n-1)} A - x^{(2-n)/(n-1)} vv^T \Big)$$ which is obviously not polynomial unless $n = 2$. Since the result does not involve noninteger powers of $x$ I am hoping there is some expression $p$ that also only involves integer powers of $x$.


Answer



For blok matrices
$$
\left[
\begin{array}{c|c}
A_{11}& A_{12} \\

\hline
A_{21} & A_{22}
\end{array}
\right]
$$
if $A_{11}$ is invertible, we have the general formula ( you can see here or here):
$$
\det \left[
\begin{array}{c|c}
A_{11}& A_{12} \\

\hline
A_{21} & A_{22}
\end{array}
\right]=
\det A_{11}\cdot \det\left( A_{22}-A_{21}A_{11}^{-1}A_{12} \right)
$$
that, in your case becomes:
$$
\det \left[
\begin{array}{c|c}

A& v \\
\hline
v^T & x
\end{array}
\right]=
\det A\cdot \det\left(x-v^TA^{-1}v \right)=\left(x-v^TA^{-1}v \right)\det A
$$


Can someone explain the following modular arithmetic?

$7^{-1} \bmod 120 = 103$



I would like to know how $7^{-1} \bmod 120$ results in $103$.

sequences and series - Prove that $frac {1}{a_1a_2} + frac {1}{a_2a_3} + frac {1}{a_3a_4} + ... + frac {1}{a_{n-1}a_n} = frac {n-1}{a_1a_n}$




There is this question in one of my math textbooks which I can't seem to figure out how to solve, it'd be awesome if you could help me :




If $a_1,a_2,a_3,...,a_n$ IS an arithmetic progression and $a_n$ is NOT equal to 0 then prove the following statement :



$\frac {1}{a_1a_2} + \frac {1}{a_2a_3} + \frac {1}{a_3a_4} + ... + \frac {1}{a_{n-1}a_n} = \frac {n-1}{a_1a_n}$




Thanks in advance...



Answer



Here's sketch, not complete proof.



Since $A$ is an arithmetic progression, Let $a_{i+1}-a_i = d$



$$\begin{align}\dfrac{1}{a_ia_{i+1}} &= \dfrac{d}{d}\dfrac{1}{a_ia_{i+1}}
\\&= \dfrac{1}{d}\dfrac{a_{i+1}-a_i}{a_ia_{i+1}} \qquad \text{since } a_{i+1}-a_i = d
\\&= \dfrac{1}{d}\left(\dfrac{1}{a_i}- \dfrac{1}{a_{i+1}}\right)\end{align}$$



Therefore, $$\begin{align} \dfrac{1}{a_1a_2}+\dfrac{1}{a_2a_3}+\cdots + \dfrac{1}{a_{n-1}a_n}&=

\sum\limits_{i = 1}^{n-1}\dfrac{1}{a_ia_{i+1}} \\&= \dfrac{1}{d}\sum\limits_{i = 1}^{n-1}\dfrac{1}{a_i}- \dfrac{1}{a_{i+1}} \\&= \dfrac{1}{d}\left(\dfrac{1}{a_1}-\dfrac{1}{a_2}+\dfrac{1}{a_2}-\cdots - \dfrac{1}{a_{n-1}} + \dfrac{1}{a_{n-1}}-\dfrac{1}{a_n} \right)\\&=\dfrac{1}{d}\left(\dfrac{1}{a_1}-\dfrac1{a_n}\right)\end{align}$$



Now, take LCM and use the fact that $a_n = a_1 +(n-1)d$


reference request - Very Elementary books on Analytic Number Theory

Till today, I was learning "Algebra", more than other subjects (analysis/topology). I thought, learning number theory may not be difficult for me.



Many theorems/statements in number theory are easy to state, but difficult to prove, in the sense, the tools required in the proof may be from real or complex analysis.



Looking some simple statements in Number Theory, I tried to give algebraic proof, but unsuccessful. Later I came to know that proving them requires "analysis". (Dirichlet's theorem on distribution of primes, or related theorems, for example.)



If the proof of some statement is based on "algebra", I can give my effort to write the proof. However, I couldn't handle easily, right now, the tools of analysis for the problems in number theory.



Can one suggest very elementary book on analytic number theory, in which, the use of tools of analysis is illustrated with examples?

trigonometry - If $A+B+C=pi$, prove: $cos(B+2C)+cos(C+2A)+cos(A+2B)=1-4cosfrac {B-C}{2};cosfrac {C-A}{2};cosfrac {A-B}{2}$




If $A+B+C=\pi$, prove that:
$$\cos(B+2C)+\cos(C+2A)+\cos(A+2B)=1-4\cos\frac {B-C}{2}\;\cos\frac {C-A}{2}\;\cos\frac {A-B}{2}$$





My Attempt:



Here, $A+B+C=\pi$



Now,
$$\begin{align}
LHS &=\cos(B+2C)+\cos(C+2A)+\cos(A+2B) \\
&=\cos(B+C+C)+\cos(C+A+A)+\cos(A+B+B) \\
&=\cos(\pi-(A-C))+\cos(\pi-(B-A))+\cos(\pi-(C-B)) \\
&=-\cos(A-C)-\cos(B-A)-\cos(C-B)

\end{align}$$



Please help to continue from here.


Answer



Let $C-A=2x,B-C=2y,A-B=2z\implies2(x+y+z)=0$



$$F=\cos2x+\cos2y+\cos2z=2\cos(x+y)\cos(x-y)+2\cos^2z-1$$



Now as $\cos(x+y)=\cos(-z)=\cos z,$




$$F=2\cos z\cos(x-y)+2\cos z\cdot\cos(x+y)-1$$
$$=2\cos z\{\cos(x+y)+\cos(x-y)\}-1=2\cos z\{2\cos x\cos y\}-1=?$$


real analysis - How to find $lim_{hrightarrow 0}frac{sin(ha)}{h}$

How to find $\lim_{h\rightarrow 0}\frac{\sin(ha)}{h}$ without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...