maj avant prise en main par sylvain

diff --git a/main.pdf b/main.pdf
index 1b07a24857c06ee1462c2e2c70dc0534598002af..3f6eba4784697c76458ed8d091870e9db840c575 100644 (file)
Binary files a/main.pdf and b/main.pdf differ

diff --git a/presPRNG.tex b/presPRNG.tex
index a7c4a55f491b7e315aacacf695987ec2a14ce377..dda026807860fb9d44c238c29a0de53b7b525ef2 100644 (file)
--- a/presPRNG.tex
+++ b/presPRNG.tex
@@ -678,6 +678,23 @@ est $\frac{1}{\mathsf{N}-1}$ $\leadsto$ à intégrer.
 }
 
 
 }
 
 

+  \begin{frame}
+    \frametitle{Perspectives}
+\begin{itemize}
+\item Qu'est-ce qu'un $\mathsf{N}$-cube?
+\item Justifier les trois arrêtes sortantes du n{\oe}ud $010$ de la figure~1. 
+\item Illustrer à l'aide d'un graphe le fait que la fonction $f^*$, définie au milieu de la~page~3  est un 3-cube privé d'un cycle hamiltonien.
+\item Pourquoi l'extension de Robinson-Cohn (page 11) n'est-elle pas un algorithme? A quoi sert la démonstration de la section 5.2?
+\item Quel est l'objectif de la section~6? 
+Ordonner les lemmes et théorèmes de cette section pour dégager le résultat 
+final. 
+\item Expliquer toutes les informations que l'on peut trouver dans la seconde 
+ligne du tableau de la page 18 (ligne portant le libéllé \og function \textcircled{a}\fg{}.
+\end{itemize}
+\end{frame}
+
+
+

 \end{document}
 
 %%% Local Variables:
 \end{document}
 
 %%% Local Variables:

diff --git a/stopping.tex b/stopping.tex
index 9d7e74f374970e7d835203cef4d985973ec8c53a..bb95663c6ca82fee5c21a017b39f496a76d6165b 100644 (file)
--- a/stopping.tex
+++ b/stopping.tex
@@ -366,7 +366,8 @@ Now using Markov Inequality, one has $\P_X(\tau > t)\leq \frac{E[\tau]}{t}$.
 With $t_n=32N^2+16N\ln (N+1)$, one obtains:  $\P_X(\tau > t_n)\leq \frac{1}{4}$. 
 Therefore, using the definition of $t_{\rm mix}$ and
 Theorem~\ref{thm-sst}, it follows that
 With $t_n=32N^2+16N\ln (N+1)$, one obtains:  $\P_X(\tau > t_n)\leq \frac{1}{4}$. 
 Therefore, using the definition of $t_{\rm mix}$ and
 Theorem~\ref{thm-sst}, it follows that

-$t_{\rm mix}\leq 32N^2+16N\ln (N+1)=O(N^2)$.
+$t_{\rm mix}(\frac{1}{4})\leq 32N^2+16N\ln (N+1)=O(N^2)$ and that 
+

 
 
 Notice that the calculus of the stationary time upper bound is obtained
 
 
 Notice that the calculus of the stationary time upper bound is obtained

diff --git a/texput.log b/texput.log
index 3eba9c9aeb6e7ac48be2d919163712f2cbfa7883..1ededd33f02a54ad4ed1891cd7cd1d376bf8d712 100644 (file)
--- a/texput.log
+++ b/texput.log
@@ -1,21 +1,21 @@
-This is pdfTeX, Version 3.14159265-2.6-1.40.17 (TeX Live 2016/Debian) (preloaded format=pdflatex 2016.9.2)  14 OCT 2016 13:12
+This is pdfTeX, Version 3.14159265-2.6-1.40.17 (TeX Live 2016/Debian) (preloaded format=pdflatex 2016.11.27)  12 DEC 2016 09:37

 entering extended mode
  restricted \write18 enabled.
  %&-line parsing enabled.
 entering extended mode
  restricted \write18 enabled.
  %&-line parsing enabled.

-**sujet.tex
+**correctionSeance3.tex presPRNG.tex

 
 ! Emergency stop.
 
 ! Emergency stop.

-<*> sujet.tex
-             
+<*> correctionSeance3.tex 
+                          presPRNG.tex

 End of file on the terminal!
 
  
 Here is how much of TeX's memory you used:
 End of file on the terminal!
 
  
 Here is how much of TeX's memory you used:

- 3 strings out of 494916
- 107 string characters out of 6179764
+ 5 strings out of 494916
+ 127 string characters out of 6179762

  45858 words of memory out of 5000000
  3409 multiletter control sequences out of 15000+600000
  3640 words of font info for 14 fonts, out of 8000000 for 9000
  14 hyphenation exceptions out of 8191
  45858 words of memory out of 5000000
  3409 multiletter control sequences out of 15000+600000
  3640 words of font info for 14 fonts, out of 8000000 for 9000
  14 hyphenation exceptions out of 8191

- 0i,0n,0p,1b,6s stack positions out of 5000i,500n,10000p,200000b,80000s
+ 0i,0n,0p,44b,6s stack positions out of 5000i,500n,10000p,200000b,80000s

 !  ==> Fatal error occurred, no output PDF file produced!
 !  ==> Fatal error occurred, no output PDF file produced!