Baccalauréat 2022 — Mathematics specialty, Polynésie 30 août 2022 (sujet 1) — exercise 2 : Sequences, functions (official exam paper)
Statement
Let $k$ be a real number.
Consider the sequence $(u_n)$ defined by its first term $u_0$ and, for every natural integer $n$,
$u_{n+1} = ku_n(1- u_n)$.
The two parts of this exercise are independent.
Two cases are studied according to the values of $k$.
Part 1
In this part, $k = 1,9$ and $u_0 = 0,1$.
Thus, for every natural integer $n$, $u_{n+1} = 1,9u_n(1 - u_n)$.
1. Consider the function $f$ defined on $[0~;~1]$ by $f(x) = 1,9x(1 - x)$.
1.a. Study the variation of $f$ on the interval $[0~;~1]$.
1.b. Deduce that if $x \in [0~;~1]$ then $f(x) \in [0~;~1]$.
2. Below are represented the first terms of the sequence $(u_n)$ constructed from the graph $\mathcal{C}_f$ of the function $f$ and the line $D$ with equation $y = x$.
Figure description: in an orthonormal coordinate system marked every tenth, for $x$ from $0$ to $1$ and $y$ from $0$ to about $0,65$, the blue parabola $\mathcal{C}_f$ with equation $y=1,9x(1-x)$ is drawn, as well as the red line $D : y=x$. A step-by-step construction, starting from $u_0=0,1$, illustrates the iterations: $u_1=f(u_0)=0,171$, then $u_2\approx 0,269$, then $u_3\approx 0,374$, and the next step goes up to about $0,445$. Dotted lines project the values $u_0$, $u_1$, $u_2$ and $u_3$ onto the axes.
Conjecture the direction of variation of the sequence $(u_n)$ and its possible limit.
3.a. Using the results of question 1, prove by induction that for every natural integer $n$:
$0 \leqslant u_n \leqslant u_{n+1} \leqslant \dfrac12$.
3.b. Deduce that the sequence $(u_n)$ converges.
3.c. Determine its limit.
Part 2
In this part, $k= \dfrac12$ and $u_0 = \dfrac14$.
Thus, for every natural integer $n$, $u_{n+1} = \dfrac12 u_n (1 - u_n)$ and $u_0 = \dfrac14$.
It is given that for every natural integer $n$: $0 \leqslant u_n \leqslant \left(\dfrac12\right)^n$.
1. Prove that the sequence $(u_n)$ converges and determine its limit.
2. Consider the Python function `algo(p)` where `p` denotes a nonzero natural integer:
```
def algo(p) :
u = 1/4
n = 0
while u > 10**(-p):
u = 1/2*u*(1 - u)
n = n+1
return(n)
```
Explain why, for every nonzero natural integer `p`, the `while` loop does not run indefinitely, which makes it possible for the command `algo(p)` to return a value.
⏳ Solution not generated yet
Open this statement in Expert Maths AI: the step-by-step solution is computed on demand, checked by a second resolution, then published here for everyone.
📝 See the solutionHave a similar exercise? Get it solved step by step, for free.
🧮 Solve my exercise