ΘρϵηΠατπ

Square Free
An integer f0 is said to be square free if there is no k1 such that k2|f
Square Free Division Characterization
f0 is square free iff for any k k2|fk{1,1}
Divisor of Square Free Product is Divisor of Other
Suppose that f0 if f is square free then a2|fb2a|b for any a,b
If a Square Free Number Divides a Square then It divides the Square Root
Suppose f0, if f is square free then f|a2f|a
Suppose that f|a2, then we have f2|fa2 therefore we have that f|a
If a Square Free Number Divides the Nth Power then it Divides the Nth Square Root
Suppose that f0 is square free then f|anf|a for any n1
We assume that f|an, now if n=1 we are done, otherwise n2 and therefore we know that 2n2+n so that 2n2n2, thus we have that f|a2(n1) therefore by assumption we know that f|an1, if n1=1 we are done, otherwise n12 and we repeat this process finitely many times until nj=1 at which point we've deduced that f|n as needed.
Power of a Square free Number Divides the Power of a Number Implies the Square Free Number Divides the Other
Suppose f0 is square free, then ff|aaf|a for any a1