
    Design a function for an adaptive learning platform that determines how many prime number exercises are available for students given a difficulty threshold value. The function should calculate the count of prime numbers less than the provided threshold to help dynamically adjust the exercise complexity level. This count will be used to ensure students have mastered an appropriate number of prime number problems before advancing to more challenging content.
    

    
def count_Primes_nums(n):
    """
    Design a function for an adaptive learning platform that determines how many prime number exercises are available for students given a difficulty threshold value. The function should calculate the count of prime numbers less than the provided threshold to help dynamically adjust the exercise complexity level. This count will be used to ensure students have mastered an appropriate number of prime number problems before advancing to more challenging content.
    

    """
def count_Primes_nums(n):
    """
    Design a function for an adaptive learning platform that determines how many prime number exercises are available for students given a difficulty threshold value. The function should calculate the count of prime numbers less than the provided threshold to help dynamically adjust the exercise complexity level. This count will be used to ensure students have mastered an appropriate number of prime number problems before advancing to more challenging content.
    

    """
    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