{"status": "success", "data": {"description_md": "There are $n$ mathematicians seated around a circular table with $n$ seats numbered $1,2,3,\\cdots,n$ in clockwise order. After a break they again sit around the table. The mathematicians note that there is a positive integer $a$ such that
(1) for each $k$, the mathematician who was seated in seat $k$ before the break is seated in seat $ka$ after the break (where seat $i+n$ is seat $i$); (2) for every pair of mathematicians, the number of mathematicians sitting between them after the break, counting in both the clockwise and the counterclockwise directions, is different from either of the number of mathematicians sitting between them before the break.
Find the number of possible values of $n$ with $1There are n mathematicians seated around a circular table with n seats numbered 1,2,3,\\cdots,n in clockwise order. After a break they again sit around the table. The mathematicians note that there is a positive integer a such that
(1) for each k, the mathematician who was seated in seat k before the break is seated in seat ka after the break (where seat i+n is seat i); (2) for every pair of mathematicians, the number of mathematicians sitting between them after the break, counting in both the clockwise and the counterclockwise directions, is different from either of the number of mathematicians sitting between them before the break.
Find the number of possible values of n with 1<n<1000.
Leading zeroes must be inputted, so if your answer is 34, then input 034. Full credit goes to MAA for authoring these problems. These problems were taken on the AOPS website.