Thread: Proving on Perfect Square?

Prove that an integer n is a perfect square if and only if Ƭ (n) is odd.

You may want to explain what that T or symbol is. If it refers to the number of positive integer divisors of n (usually denoted d(n)), the statement is true. I doubt it would be a since it can easily get confused with the gamma function.

Sorry about that. Ƭ (n) is supposed to be total number of positive divisors of n where n>0.

The proof of this should be really simple if you recall what the formula for is.