Menu Close

proof-or-given-a-counter-example-if-n-2-is-prime-then-n-Z-




Question Number 471 by 123456 last updated on 25/Jan/15
proof or given a counter example:  if n^2  is prime, then n∉Z
prooforgivenacounterexample:ifn2isprime,thennZ
Answered by prakash jain last updated on 10/Jan/15
n^2  is prime so n^2 >1.   If n∈Z, n>1 or n<−1  and ∣n∣ divides n^2  which will make n^2  composite  which contraticts n^2  is prime.
n2isprimeson2>1.IfnZ,n>1orn<1andndividesn2whichwillmaken2compositewhichcontratictsn2isprime.

Leave a Reply

Your email address will not be published. Required fields are marked *