BAC 2022 S1-S1A-S3 — Mathematics, exercise 2 : Arithmetic (official exam paper, solved)
Statement
PART A
Consider the equation $(E): 7x-3y=1$ where $x$ and $y$ are natural numbers.
1. Determine the real number $a$ such that the pair $(1,a)$ is a solution of $(E)$.
2. Solve $(E)$.
PART B
In this part, we aim to determine the pairs $(n,m)$ of nonzero natural numbers that are solutions of the equation: $7^n-3\times 2^m=1$ $(F)$.
1. Show that if the pair $(n,m)$ is a solution of $(F)$, then there exists a natural number $k$ such that: $7^{n-1}=1+3k$ and $2^m=2+7k$.
2. Show that if $m\leq 4$ then equation $(F)$ has two solution pairs.
3. Now assume $m\geq 5$.
a) Show that if the pair $(n,m)$ is a solution of $(F)$, then: $7^n\equiv 1[32]$ and $2^m\equiv 0[32]$.
b) Complete the following table.
Table to complete: first row “$n$ is equal to” with the values $1$, $2$, $3$, $4$, $5$; second row “$7^n$” with, under each value of $n$, a congruence of the form $\equiv \cdots [32]$.
c) Deduce that if the pair $(n,m)$ satisfies relation $(F)$, then $n$ is divisible by $4$.
d) Show that if the pair $(n,m)$ is a solution of $(F)$, then $7^n\equiv 1[5]$.
e) Show then that for $m\geq 5$, there is no pair $(n,m)$ of nonzero natural numbers that is a solution of $(F)$.
4. Determine the set of pairs of nonzero natural numbers that are solutions of $(F)$.
Strategy
First solve the auxiliary Diophantine equation $7x-3y=1$. Then apply it to $x=7^{n-1}$ and $y=2^m$. Finally, use congruences modulo $32$ and modulo $5$ to exclude all solutions with $m\ge 5$.
Step-by-step solution
1. Part A.1 — Determination of $a$
We want $(1,a)$ to satisfy $7x-3y=1$. Thus
$$7\cdot 1-3a=1.$$
So
$$7-3a=1,$$
$$3a=6,$$
$$a=2.$$
… and 9 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
Linear Diophantine equationCongruence modulo an integerPowers modulo $32$Proof by contradictionDivisibility
Have a similar exercise? Get it solved step by step, for free.
🧮 Solve my exercise