
    Design a function for an adaptive learning system that determines how many prime number exercises are available within a given difficulty threshold. The function should accept a positive difficulty level as input and calculate the count of prime numbers that exist below that level, enabling the system to properly scale the complexity of mathematical exercises presented to students.
    

    
def count_Primes_nums(n):
    """
    Design a function for an adaptive learning system that determines how many prime number exercises are available within a given difficulty threshold. The function should accept a positive difficulty level as input and calculate the count of prime numbers that exist below that level, enabling the system to properly scale the complexity of mathematical exercises presented to students.
    

    """
def count_Primes_nums(n):
    """
    Design a function for an adaptive learning system that determines how many prime number exercises are available within a given difficulty threshold. The function should accept a positive difficulty level as input and calculate the count of prime numbers that exist below that level, enabling the system to properly scale the complexity of mathematical exercises presented to students.
    

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