- Matrices and sequences (1 exercice)
- Transition matrix (3 exercices)
- Transition matrix type: X=AX+B (1 exercice)
- Matrices and arithmetic (1 exercice)
animals.
Thus
:
j
0
=200
and
a
0
=500
.
We
admit
that
for
any
natural
number
n
,
we
have
:
j
n
+1
=
0.125
·
j
n
+
0.525
·
a
n
a
n
+1
=
0.625
·
j
n
+
0.625
·
a
n
The
following
matrices
are
introduced
:
A
=
0.125
0.525
0.625
0.625
;
U
n
=
j
n
a
n
1
a
Show
that
for
natural
number
n
:
U
n
+1
=
A
×
U
n
.
b
Calculate
the
number
of
young
and
adult
animals
af-ter
one
year
of
observation
and
then
after
two
years
of
observation
(results
rounded
to
the
nearest
unit
by
default)
c
For
any
non-zero
natural
number
n
,
express
U
n
as
a
function
of
A
n
and
U
0
.
2
The
following
matrices
are
introduced
:
Q
=
7
3
−
5
5
;
D
=
−
0.25
0
0
1
a
We
admit
that
the
matrix
Q
is
invertible
and
that
:
Q
−
1
=
0.1
−
0.06
0.1
0.14
Show
that
:
Q
×
D
×
Q
−
1
02=
A
b
Show,
by
recurrence
on
n
,
that
for
any
non-zero
natu-ral
number
n
:
A
n
=
Q
×
D
n
×
Q
−
1
c
For
any
non-zero
natural
number
n
,
determine
D
n
as
a
function
of
n
.
3
We
admit
that
for
any
non-zero
natural
number
n
,
A
n
=
0.3
+
0.7
×
(
−
0.25)
n
0.42
−
0.42
×
(
−
0.25)
n
0.5
−
0.5
×
(
−
0.25)
n
0.7
+
0.3
×
(
−
0.25)
n
a
Deduce
the
expressions
for
j
n
and
a
n
as
a
function
of
n
.
Determine
the
limits
of
these
two
sequences.
b
What
can
be
concluded
for
the
population
of
animals
studied?
E.5955
One
bird
species
lives
on
only
two
islands
A
and
B
of
an
archipelago.
At
the
beginning
of
the
year
2013
,
20
million
birds
of
this
species
are
present
on
the
island
and
10
million
on
the
island
B
.
Observations
over
several
years
have
enabled
aornithologists
to
estimate
that,
taking
into
account
births,
deaths,
and
mi-grations
between
the
two
islands,
the
following
proposals
are
found
at
the
beginning
of
each
year:
On
the
island
A
:
80
%
of
the
number
of
birds
present
on
the
island
A
at
the
beginning
of
the
previous
year
and
30
%
of
the
number
of
birds
present
on
the
island
B
at
the
start
of
the
previous
year;
on
the
island
B
:
20
%
of
the
number
of
birds
present
on
the
island
A
at
the
beginning
of
the
previous
year
and
70
%
of
the
number
of
birds
present
on
the
island
B
at
the
start
of
the
previous
year.
For
any
natural
number
n
,
we
note
a
n
(respectively
b
n
)
the
number
of
birds
(in
millions)
present
on
the
island
A
(respec-tively
B
)
at
the
beginning
of
the
year
(2013+
n
)
.
Part
A
-
Algorithms
and
conjectures
Given
below
is
a
function
f
,
derived
from
an
algorithm,
tak-ing
as
argument
an
integer
n
greater
than
or
equal
to
2013
representing
the
year
of
study
and
returning
the
number
of
birds
living
on
each
of
the
two
islands
for
that
year.
Function
f(n)
a
←
20
b
←
10
i
←
2013
As
long
as
i<n
c
←
(0.8a+0.3b)
b
←
(0.2a+0.7b)
a
←
c
End
As
long
as
Renvoyer
(
a
;
b)
1
The
function
code
f
contains
omissions
in
processing.
Identify
these
omissions
and
correct
them.
2
Below
is
given
a
table
representing
the
values
successively
taken
by
the
variabbles
of
the
function
f
during
its
step-by-step
execution
when
called
with
the
value
2020
.
n
a
b
2013
20
10
2014
19
11
2015
18.5
11.5
2016
18.25
11.75
2017
18.125
11.875
2018
18.0425
11.9375
2019
18.03125
11.96875
2020
18.015625
11.984375
In
view
of
these
results,
make
conjectures
concerning
the
direction
of
variation
and
convergence
of
the
sequences
a
n
and
b
n
.
Part
B
-
Mathematical
study
https://chingmath.fr
chapExoCorrec/5955
sacados/5955
Centres etrangers
Juin 2013
IMS12131312113
Note
U
n
the
column
matrix
a
n
b
n
1
Show
that,
for
any
natural
number
n
:
U
n
+1
=
M
·
U
n
où
M
is
a
square
matrix
of
order
2
to
be
determined.
We
then
admit
that
U
n
=
M
n
·
U
0
for
any
natural
number
n
1
.
2
Using
reasoning
by
recurrence,
justify
that,
for
any
nat-ural
number
n
1
:
M
n
=
0.6
+
0.4
×
0.5
n
0.6
−
0.6
×
0.5
n
0.4
−
0.4
×
0.5
n
0.4
+
0.6
×
0.5
n
We
will
only
detail
the
calculation
for
the
first
of
the
coefficients
of
the
M
n
matrix.
3
Express
a
n
as
a
function
of
n
,
for
any
natural
number
n
1
.
4
With
this
model,
can
we
say
that
after
a
large
number
of
years,
the
number
of
birds
on
the
island
A
will
stabilize?
If
so,
specify
towards
what
value.
E.5957
Parts
A
and
B
can
be
processed
independently
of
each
other
In
a
remote
imaginary
village,
a
new
contagious
but
non-lethal
disease
has
appeared.
Scientists
soon
discovered
that
an
individual
could
be
in
one
of
three
states
:
S
:
ˇ
the
individual
is
healthy,
i.e.
not
ill
and
not
infecté
ı,
I
:
ˇ
the
individual
is
a
healthy
carrier,
i.e.
not
ill
but
infecté
ı,
M
:
ˇ
the
individual
is
ill
and
infecté
ı.
Part
A
Scientists
estimate
that
only
one
individual
causes
the
disease
out
of
the
100
people
in
the
population
and
that,
from
one
week
to
the
next,
an
individual
changes
state
according
to
the
following
process
:
among
healthy
individuals,
the
proportion
of
those
who
become
healthy
carriers
is
equal
to
1
3
and
the
proportion
of
those
who
become
ill
is
equal
to
1
3
.
among
healthy
carrier
individuals,
the
proportion
of
those
who
become
ill
is
equal
to
1
2
.
The
situation
can
be
represented
by
a
probabilistic
graph
as
shown
opposite.
We
note
P
n
=
s
n
i
n
m
n
the
row
matrix
giving
the
probabilistic
state
after
n
weeks
où
s
n
,
i
n
and
m
n
denote,
respectively,
the
probability
of
the
individual
being
healthy,
a
healthy
carrier
or
sick
at
n
-week.
Then
we
have
P
0
=
0.99
0
0.01
and
for
any
natural
number
n
,
s
n
+1
=
1
3
s
n
i
n
+1
=
1
3
s
n
+
1
2
i
n
m
n
+1
=
1
3
s
n
+
1
2
i
n
+
m
n
1
Write
the
matrix
A
called
transition
matrix
,
such
that
for
any
natural
number
n
:
P
n
+1
=
P
n
·
A
2
Demonstrate
by
recurrence
that
for
any
non-zero
natural
number
n
:
P
n
=
P
0
·
A
n
3
Determine
the
probabilistic
state
P
4
after
four
weeks.
Values
may
be
rounded
to
10
−
2
.
What
is
the
probability
that
an
individual
will
be
healthy
after
four
weeks?
Part
B
The
disease
doesn’t
actually
evolve
according
to
the
previous
model,
since
after
4
weeks
of
research,
scientists
discover
a
vaccine
that
halts
the
endemic
and
immediately
treats
the
entire
population.
The
weekly
evolution
of
the
disease
after
vaccination
is
given
by
the
transition
matrix:
B
=
5
12
1
4
1
3
5
12
1
4
1
3
1
6
1
2
1
3
Let’s
note
Q
n
the
row
matrix
giving
the
probabilistic
state
after
n
weeks
following
the
implementation
of
these
new
vac-cination
measures.
Thus
:
Q
n
=
S
n
I
n
M
n
où
S
n
,
I
n
and
M
n
refer
respectively
to
the
probability
of
the
individual
being
healthy,
a
healthy
carrier
and
ill
on
the
n
-th
week
after
vaccination.
For
any
natural
number
n
,
we
then
have
:
Q
n
+1
=
Q
n
·
B
From
part
A
,
Q
0
=
P
4
.
For
the
rest,
we
take
:
Q
0
=
0.01
0.10
0.89
où
coefficients
have
been
rounded
to
10
−
2
.
1
Express
S
n
+1
,
I
n
+1
and
M
n
+1
in
terms
of
S
n
,
I
n
and
M
n
.
2
Determine
the
real
constant
k
such
that
B
2
=
k
·
J
où
J
is
the
square
matrix
of
order
3
whose
coefficients
are
all
equal
to
1
.
We
deduce
that
for
any
integer
n
greater
than
or
equal
to
2
:
B
n
=
B
2
3
a
Show
that
for
any
integer
n
greater
than
or
equal
to
2
:
Q
n
=
1
3
1
3
1
3
b
Interpret
this
result
in
terms
of
disease
evolution.
Can
we
hope
to
eradicate
the
disease
with
the
vaccine?
3.
Transition
matrix
type:
X=AX+B
https://chingmath.fr
chapExoCorrec/5957
sacados/5957
Metropole
Septembre 2013
IMS12131312113
E.5953
A
telephone
operator
A
wishes
to
forecast
the
evolution
of
its
subscriber
numbers
in
a
large
city
compared
to
its
main
competitor
B
from
2013
.
In
2013
,
operators
A
and
B
each
have
300
thousand
sub-scribers.
For
any
natural
number
n
,
let
a
n
be
the
number
of
subscribers,
in
thousands,
of
the
operator
A
in
the
n
-th
year
after
2013
,
and
b
n
the
number
of
subscribers,
in
thousands,
of
operator
B
the
n
-th
year
after
2013
.
Thus
:
a
0
=300
and
b
0
=300
.
Observations
made
in
previous
years
lead
us
to
model
the
situation
by
the
following
relationship
:
a
n
+1
=
0.7
a
n
+
0.2
b
n
+
60
b
n
+1
=
0.1
a
n
+
0.6
b
n
+
70
,
for
any
integer
n
∈
N
.
Consider
the
matrices
:
M
=
0.7
0.2
0.1
0.6
;
P
=
60
70
.
For
any
natural
number
n
,
let
U
n
=
a
n
b
n
1
a
Determine
U
1
.
b
Verify
that,
for
any
natural
number
n
:
U
n
+1
=
M
×
U
n
+
P
.
2
We
note
I
the
matrix
1
0
0
1
a
Calculate:
(
I
−
M
)
×
4
2
1
3
.
b
Deduce
that
the
matrix
I
−
M
is
invertible
and
specify
its
inverse.
c
Determine
the
matrix
such
that
:
U
=
M
×
U
+
P
3
For
any
natural
number,
we
pose
:
V
n
=
U
n
−
U
.
a
Justify
that,
for
any
natural
number
n
:
V
n
+1
=
M
×
V
n
.
b
Deduce
that,
for
any
natural
number
n
:
V
n
=
M
n
×
V
0
4
We
admit
that,
for
any
natural
number
n
:
V
n
=
−
100
3
×
0.8
n
−
140
3
×
0.5
n
−
50
3
×
0.8
n
+
140
3
×
0.5
n
a
For
any
natural
number
n
,
express
U
n
as
a
function
of
n
and
deduce
the
limit
of
the
sequence
a
n
.
b
Estimate
the
number
of
subscribers
to
operator
A
in
the
long
term.
4.
Matrices
and
arithmetic
E.5956
Part
A
Consider
the
function
f
,
taken
from
an
algorithm,
taking
as
argument
a
natural
integer
A
and
reviewing
at
the
end
of
execution
the
value
of
the
variable
X
:
Function
f(A)
X
←
A
As
long
as
X
greater
than
or
equal
to
26
X
←
X
−
26
End
As
long
as
Return
X
1
What
value
is
returned
by
calling
the
function
f
when
the
value
supplied
as
an
argument
is
the
number
3
?
2
What
is
the
value
returned
by
calling
the
function
f
when
the
value
supplied
as
an
argument
is
the
number
55
?
3
For
any
integer
entered,
what
is
the
result
returned
by
this
function?
Part
B
We
want
to
code
a
block
of
two
letters
according
to
the
fol-lowing
procedure
(detailed
in
four
steps)
:
Step
1
:
each
letter
of
the
block
is
replaced
by
an
integer
using
the
table
below
:
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
We
obtain
a
column
matrix
x
1
y
2
où
x
1
corresponds
to
the
first
letter
of
the
word
and
x
2
corresponds
to
the
second
letter
of
the
word.
Step
2
:
x
1
y
1
is
transformed
into
y
1
y
2
such
that
:
y
1
y
2
=
3
1
5
2
·
x
1
x
2
The
matrix
C
=
3
1
5
2
is
called
the
coding
matrix.
Step
3
:
y
1
y
2
is
transformed
into
z
1
z
2
such
that
:
z
1
≡
y
1
(
mod.
26)
avec
0
z
1
25
z
2
≡
y
2
(
mod.
26)
avec
0
z
2
25
Step
4
:
z
1
z
2
is
transformed
into
a
two-letter
block
using
the
mapping
table
given
in
step
1
Exemple:
RE
↦−→
17
4
↦−→
55
93
↦−→
3
15
↦−→
DP
Justify
the
change
from
17
4
to
55
93
to
3
15
1
Let
x
1
,
x
2
,
x
1
,
x
2
four
integers
between
0
and
25
such
that
x
1
x
2
and
x
1
x
2
are
transformed
during
the
coding
https://chingmath.fr
chapExoCorrec/5953
sacados/5953
Polynesie
Juin 2013
chapExoCorrec/5956
sacados/5956
Antilles-Guyane
Septembre 2013
process
into
z
1
z
2
.
a
Montrer
que
3
x
1
+
x
2
≡
3
x
1
+
x
2
(
mod.
26)
5
x
1
+
2
x
2
≡
5
x
1
+
2
x
2
(
mod.
26)
b
Deduce
x
1
≡
x
1
(
mod.
26)
and
x
2
≡
x
2
(
mod.
26)
,
then
x
1
=
x
1
and
x
2
=
x
2
.
2
We
want
to
find
a
decoding
method
for
the
DP
block
a
Verify
that
the
matrix
C
=
2
−
1
−
5
3
is
the
inverse
matrix
of
C
.
b
Calculate
y
1
y
2
such
that
:
y
1
y
2
=
2
−
1
−
5
3
3
15
c
Calculate
x
1
x
2
such
that
:
x
1
≡
y
1
(
mod.
26)
avec
0
x
1
25
x
2
≡
y
2
(
mod.
26)
avec
0
x
2
25
d
What
general
decoding
procedure
can
be
conjectured?
3
In
this
question,
we
will
generalize
this
decoding
proce-dure.
Consider
a
block
of
two
letters
and
call
z
1
and
z
2
the
two
integers
between
0
and
25
associated
with
these
letters
at
step
3
.
We
try
to
find
two
integers
x
1
and
x
2
between
0
and
25
that
give
the
column
matrix
z
1
z
2
by
steps
2
and
3
of
the
coding
process.
Let
y
1
and
y
2
be
such
that
:
y
1
y
2
=
C
·
z
1
z
2
où
C
=
2
−
1
−
5
3
Let
x
1
and
x
2
be
integers
such
that
:
x
1
≡
y
1
(
mod.
26)
avec
0
x
1
25
x
2
≡
y
2
(
mod.
26)
avec
0
x
2
25
Show
that
:
3
x
1
+
x
2
≡
z
1
(
mod.
26)
5
x
1
+
2
x
2
≡
z
2
(
mod.
26)
Conclude.
4
Decode
QC
.
5.
Unclassified
financial
years
E.6067
Every
young
parent
uses
just
one
brand
of
baby
food
every
month.
Three
brands
X
,
Y
and
Z
share
the
market.
Let
n
be
a
natural
number.
Let:
X
n
the
event
ˇ
the
brand
X
is
used
in
the
month
n
ı
;
Y
n
the
event
ˇ
the
mark
Y
is
used
the
month
n
ı
;
Z
n
the
event
ˇ
the
mark
Z
is
used
the
month
n
ı
;
The
probabilities
of
the
events
X
n
,
Y
n
,
Z
n
are
noted
respec-tively
x
n
,
y
n
,
z
n
.
Each
brand’s
advertising
campaign
changes
the
distribution
:
A
buyer
of
the
brand
X
the
month
n
has
the
following
month
:
50
%
chance
of
remaining
loyal
to
this
brand.
40
%
chance
of
buying
the
brand
Y
.
10
%
chance
of
buying
brand
Z
.
A
buyer
of
brand
Y
the
month
n
has
the
following
month
:
30
%
chance
of
remaining
loyal
to
this
brand
;
50
%
chance
of
buying
the
brand
X
;
20
%
chance
of
buying
brand
Z
.
A
buyer
of
brand
Z
the
month
n
has
the
following
month
:
70
%
chance
of
remaining
loyal
to
this
brand
;
10
%
chance
of
buying
the
brand
X
;
20
%
chance
of
buying
brand
Y
.
1
a
Express
x
n
+1
as
a
function
of
x
n
,
y
n
and
z
n
.
We
assume
that
:
y
n
+1
=0.4
x
n
+0.3
y
n
+0.2
z
n
;
z
n
+1
=0.1
x
n
+0.2
y
n
+0.7
z
n
b
Express
z
n
as
a
function
of
x
n
and
y
n
.
Deduce
the
expression
of
x
n
+1
and
y
n
+1
as
a
function
of
x
n
and
y
n
.
2
We
define
the
sequence
U
n
by
U
n
=
x
n
y
n
for
any
nat-ural
number
n
.
We
admit
that,
for
any
natural
number
n
:
U
n
+1
=
A
·
U
n
+
B
où
:
A
=
0.4
0.4
0.2
0.1
;
B
=
0.1
0.2
At
the
start
of
the
statistical
study
(month
of
January
2014
:
n
=0
)
,
we
estimate
that
:
U
0
=
0.5
0.3
Consider
the
function
f
of
the
following
algorithm:
Function
f(n)
i
←
0
A
←
0.4
0.4
0.2
0.1
B
←
0.1
0.2
U
←
0.5
0.3
As
long
as
i<n
U
←
A
·
U+B
i
←
i+1
End
of
As
long
as
Return
U
a
Give
the
values
returned
by
this
function
when
called
with
the
values
n
=1
then
for
n
=3
.
https://chingmath.fr
chapExoCorrec/6067
sacados/6067
b
What
is
the
probability
of
using
brand
X
in
the
month
of
April?
In
the
remainder
of
the
exercise,
we
seek
to
determine
an
expression
for
U
n
as
a
function
of
n
.
We
denote
I
the
matrix
1
0
0
1
and
N
the
matrix
I
−
A
.
3
We
denote
by
C
a
two-row
column
matrix.
a
Demonstrate
that
C
=
A
·
C
+
B
is
equivalent
to
N
·
C
=
B
.
b
We
admit
that
N
is
an
invertible
matrix
and
that
:
N
−
1
=
45
23
20
23
10
23
30
23
Deduce
that
:
C
=
17
46
7
23
4
Note
V
n
the
matrix
such
that
V
n
=
U
n
−
C
for
any
natural
number
n
.
a
Show
that,
for
any
natural
number
n
:
V
n
+1
=
A
·
V
n
b
We
admit
that
:
U
n
=
A
n
·
U
0
−
C
+
C
.
What
are
the
probabilities
of
using
the
brands
X
,
Y
and
Z
in
the
month
of
May?
E.6253
Part
A
:
preliminaries
1
a
Let
n
and
N
be
two
natural
numbers
greater
than
or
equal
to
2
,
such
that
:
n
2
≡
N
−
1
(
mod.
N
)
Show
that
:
n
×
n
3
≡
1
(
mod.
N
)
b
Deduce
from
the
previous
question
an
integer
k
1
such
that
:
5
·
k
1
≡
1
(
mod.
26)
We’ll
admit
that
the
unique
integer
k
such
that
:
0
k
25
;
5
·
k
≡
1
(
mod.
26)
is
worth
21
.
2
We
give
the
matrices
:
A
=
4
1
3
2
;
B
=
2
−
1
−
3
4
;
X
=
x
1
x
2
;
Y
=
y
1
y
2
a
Calculate
matrix:
6
A
−
A
2
.
b
Deduce
that
A
is
invertible
and
that
its
inverse
matrix,
denoted
A
−
1
,
can
be
written
as
:
A
−
1
=
¸
·
I
+
˛
·
A
où
¸
and
˛
are
two
real
numbers
to
be
determined.
c
Check
that
:
B
=5
·
A
−
1
d
Show
that
if
A
·
X
=
Y
then
5
·
X
=
B
·
Y
.
Part
B:
coding
procedure
Code
the
word
ˇ
ET
ı,
using
the
coding
procedure
described
below.
The
word
to
be
coded
is
replaced
by
the
matrix
X
=
x
1
x
2
,
où
x
1
is
the
integer
representing
the
first
letter
of
the
word
and
x
2
the
integer
representing
the
second
according
to
the
correspondence
table
below
:
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
matrix
X
is
transformed
into
the
matrix
y
1
y
2
such
that
:
Y
=
A
·
X
.
matrix
Y
is
transformed
into
the
matrix
R
=
r
1
r
2
,
où
r
1
is
the
remainder
of
the
Euclidean
division
of
y
1
by
26
and
r
2
the
remainder
of
the
Euclidean
division
of
y
2
by
26
.
The
integers
r
1
and
r
2
give
the
letters
of
the
code
word,
according
to
the
correspondence
table
above.
Example
:
ˇ
Or
ı
(code
word)
X
14
20
Y
=
76
82
R
=
24
4
ˇ
YE
ı
(mot
codé)
Part
C
:
decoding
procedure
(we
keep
the
same
notations
as
for
coding)
During
encoding,
the
matrix
X
was
transformed
into
the
ma-trix
Y
=
y
1
y
2
such
that
:
Y
=
A
·
X
https://chingmath.fr
chapExoCorrec/6253
sacados/6253
1
Demonstrate
that
:
5
·
x
1
=
2
·
y
1
−
y
2
5
·
x
2
=
−
3
·
y
1
+
4
·
y
2
2
Using
question
1
b
from
part
A
,
establish
that
:
x
1
≡
16
·
y
1
+
5
·
y
2
(
mod.
26)
x
2
≡
15
·
y
1
+
6
·
y
2
(
mod.
26)
3
Decode
the
word
ˇ
QP
ı.
E.6938
Part
A
Consider
matrices
M
of
the
form
M
=
a
b
5
3
où
a
and
b
are
integers.
The
number
3
a
−
5
b
is
called
the
determinant
of
M
.
It
is
noted
det(
M
)
.
Thus
:
det(
M
)=3
a
−
5
b
1
In
this
question,
we
assume
that
det(
M
)
=0
and
pose
:
N
=
1
det(
M
)
·
3
−
b
−
5
a
.
Justify
that
N
is
the
inverse
of
M
.
2
Consider
the
equation
(
E
)
:
det(
M
)=3
We
wish
to
determine
all
pairs
of
integers
(
a
;
b
)
solutions
of
the
equation
(
E
)
.
a
Verify
that
the
couple
(6
;
3)
is
a
solution
of
(
E
)
.
b
Show
that
the
pair
of
integers
(
a
;
b
)
is
a
solution
of
(
E
)
if,
and
only
if,
3
·
(
a
−
6)=5
·
(
b
−
3)
Deduce
the
set
of
solutions
of
the
equation
(
E
)
.
Part
B
1
We
pose
:
Q
=
6
3
5
3
Using
the
A
part,
determine
the
inverse
matrix
of
Q
.
2
Coding
with
matrix
Q
To
code
a
two-letter
word
using
the
matrix
Q
=
6
3
5
3
,
the
following
procedure
is
used
:
Step
1:
The
word
is
associated
with
the
matrix
X
=
x
1
x
2
où
x
1
is
the
integer
corresponding
to
the
first
letter
of
the
word
and
x
2
the
integer
correspond-ing
to
the
second
letter
of
the
word
according
to
the
correspondence
table
belowbelow
:
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
Step
2:
The
matrix
X
is
transformed
into
the
matrix
Y
=
y
1
y
2
such
that
Y
=
Q
·
X
.
Step
3:
matrix
Y
is
transformed
into
the
matrix
R
=
r
1
r
2
such
that
r
1
is
the
remainder
of
the
Eu-clidean
division
of
y
1
by
26
and
r
2
is
the
remainder
of
the
Euclidean
division
of
y
2
by
26
.
Step
4
:
To
the
matrix
R
=
r
1
r
2
,
we
associate
a
two-letter
word
according
to
the
correspondence
table
in
step
1.
Example:
JE
↦→
X
=
9
4
↦→
Y
=
66
57
↦→
R
=
14
5
↦→
OF
Le
mot
JE
est
codé
en
le
mot
OE
.
Code
the
word
DO
.
3
Decoding
procedure
We
retain
the
same
notations
as
for
encoding.
During
encoding,
the
matrix
X
was
transformed
into
the
matrix
Y
such
that
Y
=
Q
·
X
.
a
Demonstrate
that
3
X
=3
·
Q
−
1
·
Y
then
that
:
3
·
x
1
≡
3
·
r
1
−
3
·
r
2
(
mod.
26)
3
·
x
2
≡
−
5
·
r
1
+
6
·
r
2
(
mod.
26)
b
Noting
that
9
×
3
≡
1
(
mod.
26)
,
show
that
:
x
1
≡
r
1
−
r
2
(
mod.
26)
x
2
≡
7
·
r
1
+
2
·
r
2
(
mod.
26)
c
Decode
the
word
SG
.
E.6940
There
are
two
urns
U
and
V
each
containing
two
balls.
Initially,
urn
U
contains
two
white
balls
and
urn
V
contains
two
black
balls.
Successive
draws
are
made
from
these
urns
in
the
following
way:
each
draw
consists
of
randomly
taking,
simultaneously,
one
ball
from
each
urn
and
putting
it
in
the
other
urn.
For
any
non-zero
natural
number
n
,
note
X
n
the
random
vari-able
equal
to
the
number
of
white
balls
contained
in
the
U
urn
at
the
end
of
the
n
-th
draw.
1
a
Translate
the
probability
into
a
sentence
:
P
(
X
n
=1)
X
n
+1
=1
then
determine
the
following
conditional
probabilities
:
P
(
X
n
=0)
X
n
+1
=1
;
P
(
X
n
=1)
X
n
+1
=1
;
P
(
X
n
=2)
X
n
+1
=1
b
Exprimer
P
X
n
+1
=1
en
fonction
de
P
X
n
=0
,
P
X
n
=1
et
P
X
n
=2
2
For
any
non-zero
natural
number
n
,
let
R
n
denote
the
row
matrix
challenged
by:
R
n
=
P
X
n
=0
P
X
n
=1
P
X
n
=2
and
consider
M
the
matrix:
0
1
0
1
4
1
2
1
4
0
1
0
Let
R
0
be
the
row
matrix
0
0
1
.
It
will
be
admitted
hereafter
that,
for
any
n
∈
N
:
R
n
+1
=
R
n
·
M
Determine
R
1
and
justify
that,
for
any
n
∈
N
:
R
n
=
R
0
·
M
n
.
3
We
admit
that
M
=
P
·
D
·
P
−
1
with
:
P
=
1
6
·
2
3
1
−
1
0
1
2
−
3
1
;
D
=
−
1
2
0
0
0
0
0
0
0
1
P
−
1
=
1
−
2
1
1
0
−
1
1
4
1
Establish
that,
for
any
n
∈
N
:
M
n
=
P
·
D
n
·
P
−
1
.
https://chingmath.fr
chapExoCorrec/6938
sacados/6938
chapExoCorrec/6940
sacados/6940
We’ll
admit
that,
for
any
natural
number:
D
n
=
−
1
2
n
0
0
0
0
0
0
0
1
4
a
Calculate
D
n
·
P
−
1
as
a
function
of
n
.
b
Knowing
that
R
0
·
P
=
1
3
−
1
2
1
6
,
determine
the
coefficients
of
R
n
as
a
function
of
n
.
5
Determine
:
lim
n
↦→
+
∞
P
X
n
=0
,
lim
n
↦→
+
∞
P
X
n
=1
et
lim
n
↦→
+
∞
P
X
n
=2
.
Interpret
these
results.
E.6942
The
aim
of
this
exercise
is
to
study,
on
an
example,
an
encryption
method
published
in
1929
by
mathematician
and
cryptologist
Lester
Hill.
This
cipher
re-lies
on
the
data
of
a
matrix
A
,
known
only
to
the
sender
and
the
receiver.
Throughout
the
exercise,
we
will
note
A
the
matrix
defined
by:
A
=
5
2
7
7
Part
A
-
Hill
encryption
Here
are
the
different
encryption
steps
for
a
word
with
an
even
number
of
letters
:
Step
1:
We
divide
the
word
into
blocks
of
two
consecutive
letters
and
then,
for
each
block,
perform
each
of
the
following
steps.
Step
2:
The
two
letters
in
the
block
are
associated
with
the
two
integers
x
1
and
x
2
both
between
0
and
25
,
which
corre-spond
to
the
two
letters
in
the
same
order,
in
the
follow-ing
table
:
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
Step
3:
We
transform
the
matrix
X
=
x
1
x
2
into
the
matrix
Y
=
y
1
y
2
vérifiant
Y
=
A
·
X
.
Step
4:
We
transform
the
matrix
Y
=
y
1
y
2
into
the
matrix
R
=
r
1
r
2
,
où
r
1
is
the
remainder
of
the
Euclidean
division
of
y
1
by
26
and
r
2
that
of
the
Euclidean
division
of
y
2
by
26
.
Step
5:
The
integers
r
1
and
r
2
are
associated
with
the
two
corre-sponding
letters
from
the
table
in
step
2
.
The
encrypted
block
is
the
block
obtained
by
juxtaposing
these
two
letters.
Question:
use
the
encryption
method
shown
to
encrypt
the
word
ˇ
HILL
ı.
Part
B
-
Some
mathematical
tools
needed
for
decryp-tion
1
Let
a
be
a
prime
relative
integer
with
26
.
Prove
that
there
exists
a
relative
integer
u
such
that
:
u
×
a
≡
1
(
mod.
26)
.
2
Consider
the
function
f
of
an
algorithm
taking
as
argu-ment
a
natural
number
a
prime
with
26
.
Function
f(a)
u
←
0
r
←
0
As
long
as
r
=
1
u
←
u+1
r
←
remainder
of
Euclidean
division
of
u
×
a
by
26
End
of
As
long
as
Return
u
We
call
the
function
f
with
parameter
value
a=21
.
a
Reproduce
on
the
copy
and
complete
the
following
ta-ble,
with
the
different
values
taken
by
the
variables
u
and
v
when
calling
the
function
f
.
u
0
1
2
·
·
·
r
0
21
·
·
·
·
·
·
b
Infer
that
:
5
×
21
≡
1
(
mod.
26)
.
3
Recall
that
A
is
the
matrix
A
=
5
2
7
7
and
note
I
the
matrix:
I
=
1
0
0
1
a
Calculate
the
matrix:
12
·
A
−
A
2
.
b
Deduce
the
matrix
B
such
that
:
B
·
A
=21
·
I
c
Demonstrate
that
if
A
·
X
=
Y
then
21
·
X
=
B
·
Y
.
Part
C
-
Decryption
We
want
to
decrypt
the
word
V
LUP
.
We
note
X
=
x
1
x
2
the
matrix
associated,
according
to
the
correspondence
table,
to
a
two-letter
block
before
encryption,
and
Y
=
y
1
y
2
the
matrix
defined
by
the
equality:
Y
=
A
·
X
=
5
2
7
7
·
X
If
r
1
and
r
2
are
the
respective
remainders
of
y
1
and
y
2
in
Eu-clidean
division
by
26
,
the
two-letter
block
after
encryption
is
associated
with
the
matrix
R
=
r
1
r
2
.
1
Show
that
:
21
·
x
1
=
7
·
y
1
−
2
·
y
2
21
·
x
2
=
−
7
·
y
1
+
5
·
y
2
2
Using
question
B
2
,
establish
that
:
x
1
≡
9
·
r
1
+
16
·
r
2
(
mod.
26)
x
2
≡
17
·
r
1
+
25
·
r
2
(
mod.
26)
3
Decipher
the
word
VLUP,
associated
with
the
matrices
21
11
and
20
15
https://chingmath.fr
chapExoCorrec/6942
sacados/6942
E.6948
A
smoker
decides
to
stop
smoking.
We
choose
to
use
the
following
model
:
if
he
doesn’t
smoke
on
a
given
day,
he
doesn’t
smoke
the
next
day
with
a
probability
of
0.9
;
if
he
smokes
on
a
given
day,
he
smokes
the
next
day
with
a
probability
of
0.6
.
We
call
p
n
the
probability
of
not
smoking
on
the
n
-th
day
after
his
decision
to
stop
smoking
and
q
n
,
the
probability
of
smoking
on
the
n
-th
day
after
his
decision
to
stop
smoking.
We
assume
that
p
0
=0
and
q
0
=1
.
1
Calculate
p
1
and
q
1
.
2
A
spreadsheet
is
used
to
automate
the
calculation
of
the
successive
terms
of
the
sequences
p
n
and
q
n
.
A
screenshot
of
this
spreadsheet
is
provided
below
:
A
B
C
D
1
n
p
n
q
n
2
0
0
1
1
3
1
4
2
5
3
In
the
column
A
are
the
values
of
the
natural
number
n
.
What
formulas
can
be
written
in
the
cells
B3
and
C3
so
that
by
copying
them
down,
we
obtain
respectively
in
the
columns
B
and
C
the
successive
terms
of
the
sequences
p
n
and
q
n
?
3
We
define
the
matrices
M
and,
for
any
natural
number
n
,
X
n
by:
M
=
0.9
0.4
0.1
0.6
et
X
n
=
p
n
q
n
We
admit
that
X
n
+1
=
M
·
X
n
and
that,
for
any
natural
number
n
,
X
n
=
M
n
·
X
0
We
define
the
matrices
A
and
B
by:
A
=
0.8
0.8
0.2
0.2
et
B
=
0.2
−
0.8
−
0.2
0.8
a
Demonstrate
that
:
M
=
A
+0.5
·
B
b
Check
that
A
2
=
A
and
that
:
A
·
B
=
B
·
A
=
0
0
0
0
.
In
the
following,
we
admit
that,
for
any
strictly
positive
natural
number
n
:
A
n
=
A
;
B
n
=
B
c
Demonstrate
that,
for
any
natural
number:
M
n
=
A
+
0.5
n
·
B
d
Deduce,
that
for
any
natural
number
n
:
p
n
=
0.8
−
0.8
×
0.5
n
e
In
the
long
term,
can
we
say
with
certainty
that
the
smoker
will
stop
smoking?
E.6949
We
give
the
matrices
:
M
=
1
1
1
1
−
1
1
4
2
1
;
I
=
1
0
0
0
1
0
0
0
1
Part
A
1
Determine
the
matrix
M
2
.
We
give
:
M
3
=
20
10
11
12
2
9
42
20
21
2
Check
that
:
M
3
=
M
2
+8
·
M
+6
·
I
3
Deduce
that
M
is
invertible
and
that
:
M
−
1
=
1
6
·
M
2
−
M
−
8
·
I
.
Part
B:
Study
of
a
particular
case
We
seek
to
determine
three
integers
a
,
b
and
c
such
that
the
parabola
of
equation
y
=
a
·
x
2
+
b
·
x
+
c
passes
through
the
points
:
A
(1
;
1)
;
B
(
−
1
;
−
1)
;
C
(2
;
5)
1
Demonstrate
that
the
problem
to
look
for
three
integers
a
,
b
and
c
such
that
:
M
·
a
b
c
=
1
−
1
5
2
Calculate
the
numbers
a
,
b
and
c
and
check
that
these
numbers
are
integers.
Part
C
:
Back
to
the
general
case
The
numbers
a
,
b
,
c
,
p
,
q
,
r
are
integers.
In
a
frame
of
reference
O
;
−→
i
;
−→
j
,
we
consider
the
points
A
(1
;
p
)
,
B
(
−
1
;
q
)
et
C
(2
;
r
)
.
We
are
looking
for
the
values
of
p
,
q
and
r
so
that
there
exists
a
parabola
with
equation
:
y
=
a
·
x
2
+
b
·
x
+
c
passing
through
A
,
B
and
C
.
1
Démontrer
que
si
a
b
c
=
M
−
1
·
p
q
r
avec
a
,
b
and
c
inte-gers,
then
:
−
3
p
+
q
+
2
r
≡
0
(
mod.
6)
3
p
−
3
q
≡
0
(
mod.
6)
6
p
+
2
q
−
2
r
≡
0
(
mod.
6)
2
Deduce
that
:
q
−
r
≡
0
(
mod.
3)
p
−
q
≡
0
(
mod.
2)
3
Reciprocally,
we
admit
that
if
:
q
−
r
≡
0
(
mod.
3)
p
−
q
≡
0
(
mod.
2)
A
,
B
,
C
are
not
alignés
then
there
are
three
integers
a
,
b
and
c
such
that
the
parabola
of
equations
:
y
=
a
·
x
2
+
b
·
x
+
c
passes
through
the
points
A
,
B
and
C
.
a
Show
that
the
points
A
,
B
and
C
are
aligned
if,
and
only
if
:
2
·
r
+
q
−
3
·
p
=0
.
b
We
choose
p
=7
.
Determine
integers
q
,
r
,
a
,
b
and
c
such
that
the
parabola
of
equation
y
=
a
·
x
2
+
b
·
x
+
c
passes
through
the
points
A
,
B
and
C
.
E.8146
ASie
June
2018
E.8150
New
Caledonia
November
2018
5
points
https://chingmath.fr
chapExoCorrec/6948
sacados/6948
Liban
Mai 2015
chapExoCorrec/6949
sacados/6949
sacados/8146
Asie
Juin 2018
Asie
sacados/8150