a^{n-1} == 1 mod n (Fermat's Little Theorem) b^{n-1 }== 1 mod n a^{n-1} = (a)a^{n-2} == 1 mod n b^{n-1 }= (b)b^{n-2} == 1 mod n (a)a^{n-2} == (b)b^{n-2} mod n If a =/= b mod n Is it true that a^{n-2} =/= b^{n-2} mod n ?
Follow Math Help Forum on Facebook and Google+
View Tag Cloud