query: Simple proof that if $a^2$ is divisible by a prime $b$ then $a$ is divisible by $b$.
positive_passages.docid: 145041
positive_passages.text: Given that $p$ is a prime and $p\mid a^n$, prove that $p^n\mid a^n$.
negative_passages.docid: 77816
negative_passages.text: Proof problem: Show that $n^2-1$ is divisible by $8$, if $n$ is an odd positive integer.
negative_passages.docid: 26336
negative_passages.text: Prove that $n(n^2 - 1)(n + 2)$ is divisible by $4$ for any integer $n$
negative_passages.docid: 108746
negative_passages.text: Prove that there exist two integers such that i - j is divisible by n.
negative_passages.docid: 5729
negative_passages.text: If $a^2+b^2+c^2=1$ then prove the following.
negative_passages.docid: 68145
negative_passages.text: If $p$ is an odd prime and $k$ an integer with $0<k<p-1$ then $1^k + 2^k + \ldots + (p-1)^k$ is divisible by $p$
negative_passages.docid: 136064
negative_passages.text: How can I prove that $\gcd(a,b)=1\implies \gcd(a^2,b^2)=1$ without using prime decomposition?
negative_passages.docid: 90916
negative_passages.text: Prove that if $3\mid a^2+b^2$ then $3\mid a$ and $3\mid b$.
negative_passages.docid: 34330
negative_passages.text: How to prove $\gcd(a^2,b^2) = (\gcd(a,b))^2$?
negative_passages.docid: 15191
negative_passages.text: If $a^2$ divides $b^2$, then $a$ divides $b$
negative_passages.docid: 20881
negative_passages.text: Prove that if $p$ and $q$ are distinct primes such that $pq\mid n^2$ then $pq\mid n$.
negative_passages.docid: 101872
negative_passages.text: Prove that $\gcd(a^2, b^2) = \gcd(a, b)^2$
negative_passages.docid: 48333
negative_passages.text: Prove by induction that $(x+1)^n - nx - 1$ is divisible by $x^2$
negative_passages.docid: 1837
negative_passages.text: Showing that $1^k+2^k + \dots + n^k$ is divisible by $n(n+1)\over 2$
negative_passages.docid: 144622
negative_passages.text: Proof: If no prime less than or equal to $\sqrt{n}$ divides $n$, then $n$ is a prime
negative_passages.docid: 40968
negative_passages.text: show if $n=4k+3$ is a prime and ${a^2+b^2} \equiv 0 \pmod n$ , then $a \equiv b \equiv 0 \pmod n$
negative_passages.docid: 113359
negative_passages.text: Proving that $x^2 + 4$ is not divisible by $3$