Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Possible Duplicate:
Proving that an integer is the $n$ th power

Let $n$ be a natural number, if $n$ is a square in $\mathbb{F}_p$ for every prime $p$, is $n$ also a square in $\mathbb{Z}$ ?

Thanks

share|improve this question

marked as duplicate by Gerry Myerson, Qiaochu Yuan Nov 9 '11 at 4:59

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

    
thanks for the link. –  wxu Nov 9 '11 at 14:10

1 Answer 1

up vote 3 down vote accepted

Yes. Consider the extension $\mathbb{Q}(\sqrt{n})/\mathbb{Q}.$ As the polynomial $x^2 - n$ factors in $\mathbb{F}_p$ for every prime $p,$ we have $p$ splits in $\mathcal{O}_{\mathbb{Q}(\sqrt{n})}$ for almost all primes $p$. It follows by the Chebotarev density theorem, $\mathbb{Q}(\sqrt{n}) = \mathbb{Q}.$ Hence, $n$ is a square in $\mathbb{Z}.$

Note that $n$ only needed to be square mod $p$ for some set of primes of density greater than $1/2$ in order to conclude $n$ was a square in $\mathbb{Z}.$

share|improve this answer
    
Oops. I didn't see the tag. Let me see if I can think of another proof. –  jspecter Nov 9 '11 at 4:36

Not the answer you're looking for? Browse other questions tagged or ask your own question.