prime factorization

I need some help on this problem for my programming course in c, to create a function that given a prime number will count the number of times is occurs in n!.
e.g.
5! = (2^3)*(3^1)*(5^1)

Lain.

This thread has over 1000 replies.
You can't reply anymore.