This is my solution, I don't no if it is true
First, we prove that n devide a1(ak-1)
then we prove that n don't devide ak(a1-1)
We have
n devide a1(a2-1) then there exist x1 that a1(a2-1)=x1.n ==>a1a2=x1.n+a1
multiplaying by (a3-1) then a1a2(a3-1)=x1.n.(a3-1)+a1(a3-1)
do a1(a3-1) is devided by n because a1a2(a3-1) is.
We repeat the same thing with a1(a3-1)
a1(a3-1) is devided by n then exist y such :
a1(a3-1)=y.n ==> a1a3=y.n+a1
multiplaying by (a4-1) .....(1)
a1a3(a4-1)=y.n(a4-1)+a1(a4-1)
a1a3(a4-1) is devided by n because a3(a4-1) is devided by n
then a1(a4-1) .........(2)
We continue, until we get that a1(ak-1) is devided by n
2) To prove that ak(a1-1) is not devided by n
we have ak(a1-1) = a1(ak-1) - (ak-a1)
a1(ak-1) s devided by n then :
ak(a1-1) is devided by n if (ak-a1) is devided by n
However ak-a1 < n then is not devided by n
Do ak(a1-1) is not devided by n..
Finally ,reply me if there is an error or a remark,please
Thank you