here are probably the fastest (not necessarily easiest) ways to address these.
I. The number of distinct factors of N is odd.
this is
true.
fastest way: just memorize this as a takeaway. in fact, it works BOTH ways:
* if a number has an odd # of total factors, then it's a perfect square
* if a number is a perfect square, then it must have an odd # of total factors
second fastest way: pair off all the factors into pairs that multiply to give the original number. since it's a perfect square, the square root will be by itself, while all the other numbers are in pairs.
for instance, if n = 36:
1, 36
2, 18
3, 12
4, 9
6
perfect squares will always have this lone # at the end, creating an odd number of overall factors. non-perfect-squares will not have it, creating an even number of overall factors (since all factors will be paired off).
II. The sum of the factors of N is odd.
actually yes, this must be
true.
this is hard to prove - the best way to approach the problem is just to throw a bunch of perfect squares at it, and observe that this works every time - but here's a proof:
background fact: if a, b, c, ... are the exponents in a prime factorization, then the number of factors is (a + 1)(b + 1)(c + 1)...
for instance, 36 is (2^2)(3^2), so a = 2 and b = 2. therefore, the total number of factors is (2 + 1)(2 + 1), or 9.
in a perfect square,
all of a, b, c, ... are EVEN. this is what makes a number a perfect square: every prime is raised to an even power.
so all of a + 1, b + 1, ... are odd.
so the total number of factors is a product of a bunch of odd numbers, and is therefore itself odd.
III. The number of distinct prime factors of N is even.
this is
false.
in a perfect square, you can have any collection of prime factors that you want.
so (c)