(Headbang)

If pq|(n^2) proof that pq|n...

p is prime and q is prime and pis not equal to q.

My proof I used the contrapositive to proof it..

if pq not divisble by n then pq is not divisible by n squared

*!= is not equal to..

Short version of proof

n!=pqk where k is element of Z

(n)^2 !=pqc where c=kpq is element of Z

please check if this is right...

How will you prove this directly?