(C#) Factorial prime numbers factorization

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

  1.  
  • Posted by on January 1st, 1970
This entry was posted in C# and tagged , , , , , , . Bookmark the permalink. Trackbacks are closed, but you can post a comment.

Post a Comment

Your email is never published nor shared. Required fields are marked *

*
*

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>

Why ask?