Solved exercises🧮 Solve my exercise

Baccalauréat 2026 — Mathematics specialty, Centres étrangers 11 juin 2026 (sujet J2) — exercise 3 : Logarithmic functions and sequences (official exam paper)

MathematicsLevel : High schoolLogarithmic functions and sequences🌐 Lire en français
Statement
Part A Let f be the function defined on the interval $\left[2 ;+\infty\right[$ by $f(x)=\ln \left(3 x^{2}+2 x\right)$. We assume that the function f is differentiable on the interval $\left[2 ; +\infty \right[$ and we denote by $f'$ its derivative function. 1. Prove that the function f is strictly increasing on the interval $[2 ;+\infty[$. 2. Let g be the function defined on the interval $[2 ;+\infty[$ by: $g(x)=f(x)-x$ We assume that the function g is strictly decreasing on the interval $[2 ;+\infty[$ and that $\lim\limits_{x \to +\infty} g(x)=-\infty$. a. Prove that the equation $g(x)=0$ has a unique solution $\alpha$ on the interval $[2 ;+\infty[$. b. Give the value of $\alpha$ rounded to the nearest hundredth. c. Deduce the sign table of the function g on the interval $[2 ;+\infty[$. Part B In this part, the answers may rely on the results of Part A. A sequence $(a_{n})$ is defined by its first term $a_{0}>0$ and for every natural integer $n$, $a_{n+1}=\ln \left(3 {a_{n}}^{2}+2 a_{n}\right)$ We study the case where $2 \leqslant a_{0} \leqslant \alpha$, where $\alpha$ is the unique solution of the equation $g(x)=0$. 1. Prove that, for every natural integer $n$, we have $2 \leqslant a_{n} \leqslant \alpha$. 2. Prove that the sequence $(a_{n})$ is increasing. 3. Prove that the sequence $(a_{n})$ converges. 4. Prove that the limit of the sequence $(a_{n})$ is $\alpha$. Part C In this part, we take $a_{0}=2$. The sequence $(a_{n})$ is thus defined by $a_{0}=2$ and for every natural integer $n$, $a_{n+1}=\ln \left(3 {a_{n}}^{2}+2 a_{n}\right)$ Let $(b_{n})$ be the sequence defined by $b_{0}=10$ and for every natural integer $n$, $b_{n+1}=\ln \left(3 {b_{n}}^{2}+2 b_{n}\right)$ We assume that the sequence $\left(b_{n}\right)$ is strictly decreasing and that it converges to $\alpha$. 1. Justify that, for every natural integer $n$, we have $a_{n} \leqslant b_{n}$. 2. Consider the script below written in Python. from math import * def algo(p): a = 2 b = 10 n = 0 while b - a > 10**(-p): a = log(3*a**2 + 2*a) b = log(3*b**2 + 2*b) n = n + 1 return (n,a) Recall that in Python: - the command texttt{log(c)} returns the value of $\ln (c)$ ; - the command texttt{a**2} returns the value of $a^{2}$. a. Give the values returned by the instruction texttt{algo(2)}. If needed, round the values to the nearest thousandth. b. Interpret the values returned in the context of the exercise.
⏳ 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 solution

Have a similar exercise? Get it solved step by step, for free.

🧮 Solve my exercise