update
update
This commit is contained in:
parent
88f7c840a6
commit
d525940229
92
03/solutions #3/solution #03.tex
Normal file
92
03/solutions #3/solution #03.tex
Normal file
@ -0,0 +1,92 @@
|
||||
\documentclass{article}
|
||||
\usepackage[utf8]{inputenc}
|
||||
\usepackage{polski}
|
||||
\usepackage{amsmath}
|
||||
\newtheorem{defn}{Definition} %this will start a definition section that can be used
|
||||
\newtheorem{theorem}{Theorem} %this will start a theorem section that can be used
|
||||
|
||||
\begin{document}
|
||||
|
||||
|
||||
|
||||
%----------------------------------------------------------------------------------------------
|
||||
% ¿Es correcto?
|
||||
% ¿Is good?
|
||||
|
||||
\begin{enumerate}
|
||||
\item Properly typeset the following command and properly refere to it in the text
|
||||
|
||||
\begin{align}
|
||||
(\sum_{i_1,\dots,i_m} a_{i_1,\dots,i_m} ^{2m}{m+1} ^{\frac{m+1}{2m}} \leq C\le \\
|
||||
\sup\{ |\sum_{i_1,\dots, i_m} a_{i_1,\dots,i_m} x^1_{i_1}\dots x^m_{i_m}|: \|(x_i^k)_{i=1}^n \|_\infty\leq1,\ 1\leq k\leq m\},
|
||||
\end{align}
|
||||
|
||||
%----------------------------------------------------------------------------------------------
|
||||
% ¿Es correcto?
|
||||
% ¿Is good?
|
||||
\item Properly typset the expression: \[R \in z\]
|
||||
|
||||
|
||||
|
||||
|
||||
%----------------------------------------------------------------------------------------------
|
||||
% ¿Es correcto?
|
||||
% ¿Is good?
|
||||
\item Properly typeset indexes in the following sum:
|
||||
\[
|
||||
f(x)=\sum_{\begin{subarray}{l} n=0 \\
|
||||
k=2\end{subarray}}^\infty a_n^k
|
||||
\]
|
||||
|
||||
|
||||
|
||||
\item Properly typeset the following theorem
|
||||
|
||||
%----------------------------------------------------------------------------------------------
|
||||
% ¿Es correcto?
|
||||
% ¿Is good?
|
||||
\begin{theorem}
|
||||
(Cauchy--Hadamard) \emph{The radius of convergence $R$ of the power series
|
||||
\[
|
||||
\sum_{n=0}^\infty a_n(z-z_0)^n\ \ \ \ \ |z-z_0|<R
|
||||
\]
|
||||
can by calculated via the following formula
|
||||
\[
|
||||
\frac{1}{R}=limsup_{n\to\infty} \sqrt[n]{|a_n|}.
|
||||
\]}
|
||||
\begin{defn}
|
||||
(Prime numbers) A number is called prime, if it is not compound.
|
||||
\end{defn}
|
||||
\end{theorem}
|
||||
|
||||
|
||||
|
||||
%----------------------------------------------------------------------------------------------
|
||||
% ¿Es correcto?
|
||||
% ¿Is good?
|
||||
|
||||
\item Typeset the follwing matrix (display-style):
|
||||
\[
|
||||
\left\{\begin{array}{cc}
|
||||
a_{11} & a_{12}\\
|
||||
a_{21} & a_{22}
|
||||
\end{array}
|
||||
\right\}
|
||||
\]
|
||||
and in the text
|
||||
$
|
||||
\left(\begin{smallmatrix}{cc}
|
||||
a_{11} & a_{12}\\
|
||||
a_{21} & a_{22}
|
||||
\end{smallmatrix}\right)
|
||||
$ Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do
|
||||
eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut
|
||||
enim ad minim veniam, quis nostrud exercitation ullamco laboris
|
||||
nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in
|
||||
reprehenderit in voluptate velit esse cillum dolore eu fugiat
|
||||
nulla pariatur. Excepteur sint occaecat cupidatat non proident,
|
||||
sunt in culpa qui officia deserunt mollit anim id est laborum.
|
||||
|
||||
\end{enumerate}
|
||||
\end{document}
|
||||
|
Loading…
Reference in New Issue
Block a user