Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

prime factorization

Name: Anonymous 2013-02-03 22:54

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)

Name: Anonymous 2013-02-03 23:14

Name: Anonymous 2013-02-03 23:14

Name: Anonymous 2013-02-03 23:14

Name: Anonymous 2013-02-03 23:14

Name: Anonymous 2013-02-03 23:14

Name: Anonymous 2013-02-03 23:14

Name: Anonymous 2013-02-03 23:14

Name: Anonymous 2013-02-03 23:14

Name: Anonymous 2013-02-03 23:14

Name: Anonymous 2013-02-03 23:14

Name: Anonymous 2013-02-03 23:14

Name: Anonymous 2013-02-03 23:14

Name: Anonymous 2013-02-03 23:14

Name: Anonymous 2013-02-03 23:14

Name: Anonymous 2013-02-03 23:14

Name: Anonymous 2013-02-03 23:14

Name: Anonymous 2013-02-03 23:15

Name: Anonymous 2013-02-03 23:15

Name: Anonymous 2013-02-03 23:15

Name: Anonymous 2013-02-03 23:15

Name: Anonymous 2013-02-03 23:15

Name: Anonymous 2013-02-03 23:15

Name: Anonymous 2013-02-03 23:15

Name: Anonymous 2013-02-03 23:15

Name: Anonymous 2013-02-03 23:15

Name: Anonymous 2013-02-03 23:15

Name: Anonymous 2013-02-03 23:15

Name: Anonymous 2013-02-03 23:15

Name: Anonymous 2013-02-03 23:15

Name: Anonymous 2013-02-03 23:15

Name: Anonymous 2013-02-03 23:15

Name: Anonymous 2013-02-03 23:15

alrite alrite i'll stop helping ^^
you'll need a way to rattle off a few low primes... then just factorize using x = y mod P == 0 // x2 = y / P

Name: Anonymous 2013-02-03 23:15

Name: Anonymous 2013-02-03 23:15

Name: Anonymous 2013-02-03 23:15

Name: Anonymous 2013-02-03 23:15

Name: Anonymous 2013-02-03 23:15

Name: Anonymous 2013-02-03 23:15

Name: Anonymous 2013-02-03 23:15

Name: Anonymous 2013-02-03 23:16

Newer Posts
All trademarks and copyrights on this site are owned by their respective parties. All comments and posts are the responsibility of their own posters.
- Tinychan + 2ch Mode -