BAC 2024 S1-S1A-S3 — Mathematics, exercise 2 : Arithmetic and numeral bases (official exam paper, solved)
Statement
1. Consider the numbers $a=57370$ and $b=104275$.
a) Determine the greatest common divisor of $a$ and $b$. (0.5 pt)
b) Does the equation $ax+by=5$ have solutions in $\mathbb{Z}\times\mathbb{Z}$? (0.25 pt)
2. Let $(E)$ be the equation: $11474x+20855y=1$.
a) Verify that the pair $(3059,-1683)$ is a solution of the equation $(E)$. (0.25 pt)
b) Solve the equation $(E)$ in $\mathbb{Z}\times\mathbb{Z}$. (0.5 pt)
c) Deduce the solutions in $\mathbb{Z}\times\mathbb{Z}$ of the equation $ax+by=5$. (0.5 pt)
3. For each of the following statements, say whether it is true or false: (0.25 pt × 4 = 1 pt)
$P_1$ : In base $p$, where $p$ is a natural integer greater than or equal to $2$, $p-1$ is a digit.
$P_2$ : In base 7, 8 is a digit.
$P_3$ : In base 16, $E$ is a digit.
$P_4$ : In base 8, the digits are: $0 ; 1 ; 2 ; 3 ; 4 ; 5 ; 6 ; 7$.
4. Two merchants, Anta and Fatou, go to the market to buy items.
An item costs 5 francs per unit.
Anta and Fatou have respectively an amount of $S_1$ and $S_2$ in francs.
We know that $S_1=1x00y2$ in base eight, and $S_2=x1y003$ in base seven.
a) Give, as a function of $x$ and $y$, the expressions of $S_1$ and $S_2$ in base ten. (0.5 pt)
b) Determine the digits $x$ and $y$ so that each of the two merchants can spend all the money at their disposal. (1 pt)
c) Deduce the number of items that each of them can buy. (0.5 pt)
Strategy
Use Euclid's algorithm for the gcd, Bezout's theorem for the Diophantine equations, the definition of digits in base p, and congruences modulo 5 for the divisibility condition in the last part.
Step-by-step solution
1. Greatest common divisor of a and b
We have a=57370 and b=104275. Euclid's algorithm gives: 104275=1×57370+46905, 57370=1×46905+10465, 46905=4×10465+5045, 10465=2×5045+375, 5045=13×375+170, 375=2×170+35, 170=4×35+30, 35=1×30+5, 30=6×5+0. Therefore gcd(57370,104275)=5.
… and 8 more step(s) in the full solution.
🔒 Full solution reserved
Free account: one full past-paper solution per week. Pro: every step-by-step solution, verified by computation, plus timed mock exams.
🔓 Read the full solutionKey concepts
Euclidean algorithmGreatest common divisorBezout's theoremLinear Diophantine equationsNumeration basesCongruences modulo 5
Have a similar exercise? Get it solved step by step, for free.
🧮 Solve my exercise