A set of k integers is said to be a complete residue system modulo k if no two of its elements are congruent modulo k. Find all positive integers m so that there are infinitely many positive integers n wherein {1n,2n,…,mn} is a complete residue system modulo m. number theorymoduloresidue