\( \definecolor{colordef}{RGB}{249,49,84} \definecolor{colorprop}{RGB}{18,102,241} \)
Consider the following statement: "Let \(n \geq 2\) and \(a\) be integers. If \(n \mid a^2\), then \(n \mid a\)."
  1. Show that this statement is false in general by providing a counterexample.
  2. Prove that the statement is true if \(n\) is a prime number \(p\).

Capture an image of your work. AI teacher feedback takes approximately 10 seconds.