75 lines
1.6 KiB
TeX
75 lines
1.6 KiB
TeX
|
\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}
|
||
|
|
Conjugué de
|
||
|
|
\[
|
||
|
|
z = (3 + 4i)(i+1)
|
||
|
|
\]
|
||
|
|
\end{frame}
|
||
|
|
|
||
|
|
\begin{frame}{Calcul 2}
|
||
|
|
Résoudre l'équation
|
||
|
|
\[
|
||
|
|
20\times e^{-2x} = 10
|
||
|
|
\]
|
||
|
|
\end{frame}
|
||
|
|
|
||
|
|
\begin{frame}{Calcul 3}
|
||
|
|
\begin{center}
|
||
|
|
\begin{minipage}{0.7\linewidth}
|
||
|
|
\begin{algorithm}[H]
|
||
|
|
\SetAlgoLined
|
||
|
|
$u \leftarrow 2$ \;
|
||
|
|
$n \leftarrow 0$ \;
|
||
|
|
\Tq{$\cdots$}{
|
||
|
|
$u \leftarrow u*2$ \;
|
||
|
|
$n \leftarrow n+1$ \;
|
||
|
|
}
|
||
|
|
\Sortie{n}
|
||
|
|
\end{algorithm}
|
||
|
|
\end{minipage}
|
||
|
|
\end{center}
|
||
|
|
Compléter l'algorithme pour qu'il trouve le plus petit $n$ tel que $u>50$.
|
||
|
|
\end{frame}
|
||
|
|
|
||
|
|
\begin{frame}{Calcul 4}
|
||
|
|
Compléter le tableau de signe pour la fonction
|
||
|
|
\[
|
||
|
|
f(x) = x^2 + 2x - 3
|
||
|
|
\]
|
||
|
|
\begin{center}
|
||
|
|
\begin{tikzpicture}[baseline=(a.north)]
|
||
|
|
\tkzTabInit[lgt=2,espcl=2]{$x$/1,$f(x)$/1}{$-\infty$, $\cdots$, $\cdots$, $+\infty$}
|
||
|
|
\tkzTabLine{, + , z, -, z, +, }
|
||
|
|
\end{tikzpicture}
|
||
|
|
\end{center}
|
||
|
|
|
||
|
|
\end{frame}
|
||
|
|
|
||
|
|
\begin{frame}{Fin}
|
||
|
|
\begin{center}
|
||
|
|
On retourne son papier.
|
||
|
|
\end{center}
|
||
|
|
\end{frame}
|
||
|
|
|
||
|
|
|
||
|
|
\end{document}
|