MathDB
first k elements of permutation of first n have distinct remainder mod k

Source: Canadian Junior Mathematical Olympiad - CJMO 2021 p2

May 29, 2021
remaindernumber theory

Problem Statement

How many ways are there to permute the first nn positive integers such that in the permutation, for each value of knk \le n, the first kk elements of the permutation have distinct remainder mod kk?