Determine n betwen 0 and 8 such that ^= n mod 9

Note that 1111 is not divisible by 3, so it follows that (they are coprime). Given that , where is the Euler totient/phi function, and that



we can then write



By Euler's theorem, we have



and so



Note that



which means



so .