King Arthur gets the knights on the round table. There are K-knights and N-cards on the round table, where N>=K. Arthur says that if A*(B - 1) is satisfied for every card pick of the knights, where A is the card of a knight, and B is a card of the knight left of the one who picked A, they won't go to war. the cards are numbered 1,2,3,..,N.
Is it possible not to go to war?
Update : A*(B-1) to be divisible by N.
Update 2: They pick cards 1 to N, where N>=K, and A(B-1) to be divisible by N.
Is it possible not to go to war?
Update : A*(B-1) to be divisible by N.
Update 2: They pick cards 1 to N, where N>=K, and A(B-1) to be divisible by N.