Power of a prime number r in n! in C++

---

<p style="">In this problem, we are given two integer n and r. Our task is to find the power of the given prime number r in the factorial of the number n.</p><p>Let&rsquo;s take an example to understand the problem</p><p><strong>Input</strong> &minus; n = 6 r = 2</p><p><strong>Output</strong> &minus; 4</p><p style=""><strong>Explanation</strong> &minus;</p><pre class="result notranslate" style="">Factorial n, 6! = 6*5*4*3*2*1 = 720 720 = 2⁴ * 3² * 5, power of 2 is 4</pre><p>To solve this problem, a simple solution would be directly finding the factorial and then finding the power of the prime number. But this is not the best solution.</p><p>Another efficient solution is using a formula,</p><p>Power of &lsquo;r&rsquo; in n! = floor(n/r) + floor(n/r2) + floor(n/r3) + ...</p><h2>Example</h2><p>Program to show the implementation of our solution,</p><p><a class="demo" href="http://tpcg.io/4PJVxPLd" rel="nofollow" target="_blank">&nbsp;Live Demo</a></p><pre class="prettyprint notranslate" style="">#include &lt;iostream&gt; using namespace std; int primePower(int n, int r) { &nbsp; &nbsp;int count = 0; &nbsp; &nbsp;for (int i = r; (n / i) &gt;= 1; i = i * r) &nbsp; &nbsp; &nbsp; count = count+n/i; &nbsp; &nbsp;return count; } int main() { &nbsp; &nbsp;int n = 6, r = 2; &nbsp; &nbsp;cout&lt;&lt;&quot;Power of prime number &quot;&lt;&lt;r&lt;&lt;&quot;in factorial &quot;&lt;&lt;n&lt;&lt;&quot; is : &quot;&lt;&lt;primePower(n, r); &nbsp; &nbsp;return 0; }</pre><h2>Output</h2><pre class="result notranslate">Power of prime number 2in factorial 6 is : 4</pre>

• Related Questions & Answers
• Finding the power of prime number p in n! in C++
• Primitive root of a prime number n modulo n in C++
• Find power of power under mod of a prime in C++
• How to find prime factors of a number in R?
• Program for power of a complex number in O(log n) in C++
• Number of digits in 2 raised to power n in C++
• Kth prime number greater than N in C++
• How to find the fractional power of a negative number in R?
• Calculating power of a number in MySQL?
• Check whether N is a Dihedral Prime Number or not in Python
• Nearest prime less than given number n C++
• Print the nearest prime number formed by adding prime numbers to N
• Prime factors of a big number in C++
• Prime factor array of a Number in JavaScript
• Prime digits sum of a number in JavaScript