Suppose p is a prime dviding a^k. Show that p|a and show p^k | a^k. Use the order function to show this.
Follow Math Help Forum on Facebook and Google+
What exactly do you mean by the order function?
If m is a nonzero integer and if p is a prime, then Ordp(m) is the largest integer k such that p^k divides m.
Originally Posted by jzellt If m is a nonzero integer and if p is a prime, then Ordp(m) is the largest integer k such that p^k divides m. That's what I assumed, but I just wanted to be sure.
So, any advice on this one...
View Tag Cloud