I have read a result on computing the highest power of a prime that divides $n!$. I was wondering if there are any results on how to compute the highest power of a prime dividing $f(x)$, where $f$ is a function on the real numbers that outputs integer values.
The highest power of a prime that divides $f(x)$
1
$\begingroup$
number-theory
prime-numbers
-
1For general $f$, apart from brute-force, I don't see how. – 2010-11-26
-
0Sorry I don't mean a general $f$. I meant whether do we have results for other specific functions like the one we have for factorials. – 2010-11-26