The conjecture that for every integer n, the value of n^2 is positive, is true
How to prove the conjecture?
The conjecture is given as:
For every integer n, the value of n^2 is positive.
Let n be a positive integer.
Such that:
n = k
This means that:
n^2= k^2 --- positive
Let n be a negative integer.
Such that:
n = -k
This means that:
n^2= (-k)^2
Evaluate
n^2= k^2 --- positive
Hence, the conjecture is true
Read more about conjectures at:
https://brainly.com/question/14928435
#SPJ1
