I am trying to find n such that is divisible by 13.
I am trying to let and which gives . But I end up running in circles and getting nowhere!
Follow Math Help Forum on Facebook and Google+
And this cycle repeats. So we know the least residues of (mod 13) for all is 3, 9, or 1.
Since implies , we have to find such that .
As it turns out, 2 is a primitive root modulo 13. So see for which such that .
See if you can figure it out from here.
great that worked! I just determined the reside system for and then checked for what values of n, their sum added appropriately!
View Tag Cloud