Determine n between 0 and 8 such that 1111^2222 equivalent to n mod 9. I need to show the steps. Thanks!
Follow Math Help Forum on Facebook and Google+
Originally Posted by kturf Determine n between 0 and 8 such that 1111^2222 equivalent to n mod 9. I need to show the steps. Thanks! Merely note that, so that . But, . So, . But, . But, . So, we may finally conclude that
Hello kturf Originally Posted by kturf Determine n between 0 and 8 such that 1111^2222 equivalent to n mod 9. I need to show the steps. Thanks! Here's an alternative approach. And Grandad
Originally Posted by Grandad Hello kturfHere's an alternative approach. And Grandad One of us started with the base and the other with the exponent! Haha! You solution is probably better though since you didn't need to invoke Euler.
Hello, kturf! Determine between 0 and 8 such that: . Since , we have: . We want the remainder when is divided by 9. We find that: . . The remainders move through a 3-step cycle. Since , we have: . Therefore: .
View Tag Cloud