show that a^13 is congruent to a (modulo 2730)(adsbygoogle = window.adsbygoogle || []).push({});

if a is an integer such that a is not divisidble by 3, or such that a IS divisible by 9, then a^7 is congruent to a (mod 63)

with these, could i just divide the mod numbers by the powers? that is what i am doing, but it seems like as though it ISN'T right... anyone help ?

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Mods that will rack your brain

**Physics Forums | Science Articles, Homework Help, Discussion**