... Let $a_n$ be a sequence of positive integers none of which is 1 greater (less) than a power of two . ... These two expressions differ from one another by a quantity of the order of $h^2$ . ... On the upper part of the (a) curve . ... The elements on the (main) diagonal of the matrix $A$ . ... On the lower part of the (a) curve . ... Any one-step ODE-method on a mesh (grid) can be considered as a first-order difference equation . ... G$ is less than a third of the distance between these two points . ...

Еще в разделе: (Показать все результаты (>2) - num-anal.srcc.msu.ru/ )

• http://num-anal.srcc.msu.su/list_wrk/ps/b3.ps

The beamer class Manual for version 3.06. \begin{frame} \frametitle{There Is No Largest Prime Number} \framesubtitle{The proof uses \textit{reductio ad absurdum}.} \begin{theorem} There is no largest prime number. \end{theorem} \begin{proof} \begin{enumerate} \item<1-| alert@1> Suppose $p$ were the largest prime number. \item<2-> Let $q$ be the product of the first $p$ numbers. \item<3-> Then $q+1$ is not divisible by any of them. \item<1-> Thus $q+1$ is also prime and greater than $p$.\qedhere

190. Современные методы анализа сложных стохастических систем