Groups and FieldsSuperchallengeCosets and Lagrange's Theorem ShareCosets and Lagrange's Theorem · Superchallenge problemWhat is the smallest composite nnn with 2n−1≡1(modn)2^{n-1}\equiv1\pmod{n}2n−1≡1(modn)?Check Show answer Walk through it step by step Practice more like this Review this concept