construct/rlve prefix product permutation
construct/rlve prefix product permutation: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Find a permutation p 1, ..., p 701 of the integers 1, 2, ..., 701 such that the 701 prefix products p 1, p 1 p 2, ..., p 1 p 2 ... p 701 are pairwise distinct modulo 701.
The task
Find a permutation p_1, ..., p_701 of the integers 1, 2, ..., 701 such that the 701 prefix products p_1, p_1*p_2, ..., p_1*p_2*...*p_701 are pairwise distinct modulo 701.