Baccalauréat 2026 — Mathematics specialty, Polynésie 17 juin 2026 (J2) — exercise 2 : Logarithm function and recursive sequence (official exam paper)
Statement
In this exercise, Parts A and B are independent.
Part A
We consider the function $f$ defined for every $x \in [4 ; 10]$ by $f(x) = \ln(8x^3 - 1)$.
We assume that the function $f$ is differentiable on $[4 ; 10]$ and we denote by $f'$ its derivative function.
1. Show that for every $x \in [4 ; 10]$, we have:
\[f'(x) = \frac{24x^2}{(2x-1)(4x^2+2x+1)}.\]
2.
a. Deduce that $f$ is increasing on $[4 ; 10]$.
b. Show that, for every $x \in [4 ; 10]$, we have:
\[4 \leqslant f(x) \leqslant 10.\]
3. We define the function $g$ defined for every $x \in [4 ; 10]$ by $g(x) = f(x) - x$.
We assume that $g$ is strictly decreasing on its domain.
a. Show that, on the interval $[4 ; 10]$, the equation $g(x) = 0$ has a unique solution $\alpha$.
b. Determine an enclosure to within $10^{-3}$ of $\alpha$.
Part B
We assume that we can define the sequence $(u_n)$ by $u_0 = 5$ and for every natural integer $n$, by $u_{n+1} = f(u_n)$, where $f$ is the function studied in Part A.
1. Give an approximate value of $u_1$ to within $10^{-1}$.
2.
a. Show, using a proof by induction, that for every $n \in \mathbb{N}$, we have:
\[4 \leqslant u_n \leqslant u_{n+1} \leqslant 10.\]
b. Deduce that the sequence $(u_n)$ converges.
3. Show that the sequence $(u_n)$ converges to the number $\alpha$, defined in Part A.
Part C
In this part, we assume that $8,4 \leqslant \alpha \leqslant 8,5$.
A function alpha has been created in Python.
It is specified that in Python, the instruction log corresponds to $\ln$.
Python code:
```python
def f(x) :
return log(8*x**3 - 1)
def alpha(a):
n = 0
u = 5
while u < a:
u = f(u)
n = n + 1
return n
```
1. We assume that alpha(8.499) returns the value 11.
Interpret this result in the context of the exercise.
2. A user runs alpha(8.6).
Explain why no value is then returned.
⏳ 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