Thread Closed

Prove that a^t = -1 (mod p^k) for....

 
Share Thread Thread Tools
Mar19-08, 01:14 AM   #1
xax
 

Prove that a^t = -1 (mod p^k) for....


p<>2, prime and ord p^k (a) = 2t.
 
PhysOrg.com
PhysOrg
science news on PhysOrg.com

>> Heat-related deaths in Manhattan projected to rise
>> Dire outlook despite global warming 'pause': study
>> Sea level influenced tropical climate during the last ice age
Mar21-08, 03:13 AM   #2
 
Recognitions:
Gold Membership Gold Member
I am not certain about the meaning of p<>2, but if the order of a is 2t, then a^t==-1 Mod p^k....Because there are only two elements of order 2, and phi(2) =1, which tells us only one element belongs to 2. That is, if x^2==1 Mod P^k, then (x-1)(x+1) == 0 Mod P^k. So in an integral domain, one of the terms under discussion (a^t-1) or (a^t+1) will be equal to zero, Mod p^k.
 
Mar23-08, 10:25 AM   #3
xax
 
Thanks robert for your help, but how can I say that only a^t+1 = 0 mod p^k and it's not possible a^t-1=0 mod p^k?
Edit: p<>2 means p can't be 2.
 
Mar23-08, 01:54 PM   #4
 
Recognitions:
Gold Membership Gold Member

Prove that a^t = -1 (mod p^k) for....


Because the order is even. If a^t-1 = 0 Mod p^k, then the order is odd.
 
Mar23-08, 02:53 PM   #5
xax
 
got it robert, thank you.
 
Thread Closed
Thread Tools


Similar Threads for: Prove that a^t = -1 (mod p^k) for....
Thread Forum Replies
Please prove this Differential Geometry 6
Need help proving an expression of roots of sums including roots General Math 16
To Prove Calculus 3
Prove the following: Introductory Physics Homework 3
is this ok to prove? Introductory Physics Homework 6