ChallengeSuperchallengeAdvanced Number Theory
Advanced Number Theory · Superchallenge problem
Find the number of subsets of (including the empty set) that contain no two consecutive integers, modulo .
Find the number of subsets of (including the empty set) that contain no two consecutive integers, modulo .