My teacher gave us an extra credit problem using sage, I am having soo much trouble just trying to get started and was hoping for any sort of help possible. Heres the question: An element a in Z mod n is a square if there is some b element of Z mod n such that a^2 = b. Find the number of squares in Z mod p^(n). Would the code look something like this:
for p^2 = b, let p be prime:
print modulo(Integer(Z): .... This is my first time ever using a computer program. Sage seems very powerful and I expect to use it more during my school break, but if anyone can help me now, I would greatly appreciate it!!!!!
`
