67 lines
1.3 KiB
TeX
Executable File
67 lines
1.3 KiB
TeX
Executable File
\documentclass[14pt]{classPres}
|
|
\usepackage{tkz-fct}
|
|
\usepackage[linesnumbered, boxed, french]{algorithm2e}
|
|
|
|
\author{}
|
|
\title{}
|
|
\date{}
|
|
|
|
\begin{document}
|
|
\begin{frame}{Questions flashs}
|
|
\begin{center}
|
|
\vfill
|
|
Tsti2d
|
|
\vfill
|
|
30 secondes par calcul
|
|
\vfill
|
|
\small \jobname
|
|
\end{center}
|
|
\end{frame}
|
|
|
|
\begin{frame}{Calcul 1}
|
|
Soit $X$ une variable aléatoire qui suit la loi $\mathcal{U}([3, 4])$.
|
|
\[
|
|
P(2 < X < 3,3) =
|
|
\]
|
|
\end{frame}
|
|
|
|
\begin{frame}{Calcul 2}
|
|
Résoudre l'inéquation
|
|
\[
|
|
e^x > e^{2x-4}
|
|
\]
|
|
\end{frame}
|
|
|
|
\begin{frame}{Calcul 3}
|
|
\begin{center}
|
|
\begin{minipage}{0.7\linewidth}
|
|
\begin{algorithm}[H]
|
|
\SetAlgoLined
|
|
$u \leftarrow 2$ \;
|
|
$n \leftarrow 0$ \;
|
|
\Tq{$n < 10$}{
|
|
$u \leftarrow u*2$ \;
|
|
$n \leftarrow n+1$ \;
|
|
}
|
|
\end{algorithm}
|
|
\end{minipage}
|
|
\end{center}
|
|
Combien vaut $n$ à la fin de cet algorithme?
|
|
\end{frame}
|
|
|
|
\begin{frame}{Calcul 4}
|
|
Conjugué de
|
|
\[
|
|
z = 3 + 4i
|
|
\]
|
|
\end{frame}
|
|
|
|
\begin{frame}{Fin}
|
|
\begin{center}
|
|
On retourne son papier.
|
|
\end{center}
|
|
\end{frame}
|
|
|
|
|
|
\end{document}
|