MathCastle
ChallengeSuperchallengeAdvanced Number Theory

Advanced Number Theory · Superchallenge problem

Find the number of subsets of {1,2,…,12}\{1, 2, \ldots, 12\} (including the empty set) that contain no two consecutive integers, modulo 10001000.