1
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)
2
Name:
Anonymous
2013-02-03 23:02
What part do you need halp with?
58
Name:
Anonymous
2013-02-03 23:10
...should be not too hard anyway
152
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
1000
Name:
Over 1000 Thread
2013-02-03 23:55
Over 1000
This thread has over 1000 replies. You can't reply anymore.
1002
Name:
Over 1000 Thread
2013-09-03 6:26
Over 1000
This thread has over 1000 replies. You can't reply anymore.