Number TheoryChallengeThe Chinese Remainder Theorem ShareThe Chinese Remainder Theorem · Challenge problemHow many xxx with 0≤x<910 \le x < 910≤x<91 satisfy x2+x+1≡0(mod91)x^2 + x + 1 \equiv 0 \pmod{91}x2+x+1≡0(mod91)?Check Show answer Walk through it step by step Practice more like this Review this concept