Factorial prime numbers factorization


/ Published in: C#
Save to your folder(s)

Find how many factors there is in N! for a prime P
Ex: 5! = (2^3)*(3^1)*(5^1)
mult(5,2) = 3
mult(5,3) = 1
mult(5,5) = 1
all else = 0

Report this snippet


Comments

RSS Icon Subscribe to comments

You need to login to post a comment.