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

        return n / p + self.prime_count(p, n / p)
Return the decompressed binary data representing a chunk.
dataset/ETHPy150Open algorhythms/HackerRankAlgorithms/Manasa and Factorials.py/Solution.prime_count--crossover with--dataset/ETHPy150Open twoolie/NBT/nbt/region.py/RegionFile.get_blockdata