
    Design a function for an adaptive learning system that determines how many practice problems to generate by counting the prime numbers up to a student's current difficulty threshold. The function should take the student's difficulty level as input (represented by a positive number) and calculate the total count of prime numbers below this threshold, which will be used to create an appropriate set of exercises. This adaptive approach ensures students receive the right amount of practice problems based on their current understanding of prime numbers.
    

    
def count_Primes_nums(n):
    """
    Design a function for an adaptive learning system that determines how many practice problems to generate by counting the prime numbers up to a student's current difficulty threshold. The function should take the student's difficulty level as input (represented by a positive number) and calculate the total count of prime numbers below this threshold, which will be used to create an appropriate set of exercises. This adaptive approach ensures students receive the right amount of practice problems based on their current understanding of prime numbers.
    

    """
def count_Primes_nums(n):
    """
    Design a function for an adaptive learning system that determines how many practice problems to generate by counting the prime numbers up to a student's current difficulty threshold. The function should take the student's difficulty level as input (represented by a positive number) and calculate the total count of prime numbers below this threshold, which will be used to create an appropriate set of exercises. This adaptive approach ensures students receive the right amount of practice problems based on their current understanding of prime numbers.
    

    """
    ctr = 0
    for num in range(n):
        if num <= 1:
            continue
        for i in range(2, num):
            if num % i == 0:
                break
        else:
            ctr += 1
    return ctr