Baccalauréat 2023 — Mathematics specialty, Métropole, Antilles-Guyane 11 septembre 2023 (sujet 1) — exercise 1 : MCQ: antiderivatives, sequences and algorithm (official exam paper)
Statement
This exercise is a multiple-choice questionnaire.
For each of the following questions, only one of the four proposed answers is correct.
A correct answer scores one point. An incorrect answer, multiple answers, or no answer to a question scores neither gains nor loses any point.
To answer, indicate on the answer sheet the question number and the letter of the chosen answer.
No justification is required.
1. Consider the function $f$ defined on $\mathbb{R}$ by
$f(x)=x\mathrm{e}^{x^2-3}$.
One of the antiderivatives $F$ of the function $f$ on $\mathbb{R}$ is defined by:
a. $F(x)=2x\mathrm{e}^{x^2-3}$
b. $F(x)=\left(2x^2+1\right)\mathrm{e}^{x^2-3}$
c. $F(x)=\dfrac12 x\mathrm{e}^{x^2-3}$
d. $F(x)=\dfrac12 \mathrm{e}^{x^2-3}$
2. Consider the sequence $(u_n)$ defined for every natural integer $n$ by: $u_n=\mathrm{e}^{2n+1}$.
The sequence $(u_n)$ is:
a. arithmetic with common difference 2;
b. geometric with common ratio e;
c. geometric with common ratio $\mathrm{e}^2$;
d. convergent to e.
For questions 3. and 4., consider the sequence $(u_n)$ defined on $\mathbb{N}$ by:
$u_0=15$ and for every natural integer $n$ : $u_{n+1}=1,2u_n+12$.
3. The following Python function, whose line 4 is incomplete, must return the smallest value of the integer $n$ such that $u_n>10\,000$.
Code :
`def seuil() :`
` n=0`
` u=15`
` while ... ...:`
` n=n+1`
` u=1,2*u+12`
` return(n)`
At line 4, we complete with:
a. $u\leqslant 10\,000$ ;
b. $u=10\,000$ ;
c. $u>10\,000$ ;
d. $n\leqslant 10\,000$.
4. Consider the sequence $(v_n)$ defined on $\mathbb{N}$ by: $v_n=u_n+60$.
The sequence $(v_n)$ is:
a. a decreasing sequence;
b. a geometric sequence with common ratio 1,2;
c. an arithmetic sequence with common difference $60$;
d. a sequence that is neither geometric nor arithmetic.
⏳ 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