Abstract
Let p be a prime > 2 and m an arbitrary positive integer; definewhere (r/p) is the Legendre symbol. We consider the problem of finding the highest power of p dividing Sm. A little more generally, if we putwhere a is an arbitrary integer, we seek the highest power of p dividing Sm(a). Clearly Sm = Sm(0), and Sm(a) = Sm(b) when a ≡ b (mod p).
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
