prime divisors
Hi again all,
Some of us are familiar with proper divisors.
For example, the proper divisors of 9 are 1 and 3.
Also, the proper divisors of 35 are 5 and 7.
~
Made a Maple procedure
called ProperDivisors(b).
Has count function
Pretty easy to understand
For example 
CPD(6) = 6
That is count proper divisors is 1 and two and three is 6.
Another example
CPD(19) = 1
See my 'blog o ria'
My (big) question is,
Suppose you have a general positive integer
in factored form
call it d.
So d = p1^e1 * p2^e2 * ...
what is its count of proper divisors?
Is there a Maple function?
what is CPD(d) ?
Let me know.
Regards,
Matt
