MathDB

Annie has a permutation

(a_1, a_2, \dots ,a_{2019})

S=\{1,2,\dots,2019\}

, and Yannick wants to guess her permutation. With each guess Yannick gives Annie an

n

-tuple

(y_1, y_2, \dots, y_{2019})

of integers in

S

, and then Annie gives the number of indices

i\in S

such that

a_i=y_i

.
(a) Show that Yannick can always guess Annie's permutation with at most

1200000

guesses. (b) Show that Yannick can always guess Annie's permutation with at most

24000

guesses.
Yannick Yao

Problem Statement