Great explanations guys, but is there a specific rule for this?
Seeing the workings above, I get a little lost if I don't see some kind of theory...
Its a combination problem...so
* Formular of getting number of factors of (a^p) x (b^r) x (c^s)
(a, b, and c are prime numbers)
= (p+1) x (r+1) x (s+1)
Basically you have to take into account (a^0) * (b^0) * (c^0) because for every a^p, there is a a^0, that is why you have to add the 1.
So for example:
how many positive factors are there for 6?
Working: 2^1 * 3^1
Formula: (1+1)*(1+1) = 4 ==> there are a total of 4 positive factors of 6 (1, 2, 3, 6)