document.write( "Question 1207670: Let $a$ be an integer such that $0 \le a \le 10$ and $a^2 \equiv a \pmod{11}$. If $a \neq 0,$ then find the value of $a$. \n" ); document.write( "
Algebra.Com's Answer #845674 by math_tutor2020(3817)![]() ![]() ![]() You can put this solution on YOUR website! \n" ); document.write( "Since \n" ); document.write( "Technically it's not division that's happening, but instead multiplication of the multiplicative inverse. \r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "---------------------------------------------------------------------------------\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Another pathway is \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "That leads to either a = 0 or a-1 = 0 \n" ); document.write( "But \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "---------------------------------------------------------------------------------\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Yet another alternative method is to simply brute force your way through things. \n" ); document.write( "Try a = 1, a = 2, etc all the way up to a = 10.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "a = 1 \n" ); document.write( "a^2 = a (mod 11) \n" ); document.write( "1^1 = 1 (mod 11) \n" ); document.write( "1 = 1 (mod 11) \n" ); document.write( "That works out\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "a = 2 \n" ); document.write( "a^2 = a (mod 11) \n" ); document.write( "2^2 = 2 (mod 11) \n" ); document.write( "4 = 2 (mod 11) \n" ); document.write( "That doesn't work out since the two sides don't boil down to same number, and we cannot reduce either side.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "a = 3 \n" ); document.write( "a^2 = a (mod 11) \n" ); document.write( "3^2 = 3 (mod 11) \n" ); document.write( "9 = 3 (mod 11) \n" ); document.write( "That doesn't work out either.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "a = 4 \n" ); document.write( "a^2 = a (mod 11) \n" ); document.write( "4^2 = 4 (mod 11) \n" ); document.write( "16 = 4 (mod 11) \n" ); document.write( "5 = 4 (mod 11) \n" ); document.write( "This is the first time that we reduce mod 11 on the left hand side. \n" ); document.write( "You can repeatedly subtract 11 from the item until getting in the range of between 0 and 10, or you can divide by 11 to look at the remainder. \n" ); document.write( "Like the previous cases, the two sides don't match, so a = 4 isn't a solution.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Keep this process going and you'll find that the values a = 5 through a = 10 are also non-solutions.\r \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "This confirms that only a = 1 is the solution. \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " |