def prime_count(self, p, n):
        if n < p:
            return 0

        return n / p + self.prime_count(p, n / p)
count number of p in n!'s factors, where p is a prime number
dataset/ETHPy150Open algorhythms/HackerRankAlgorithms/Manasa and Factorials.py/Solution.prime_count