Please create a pseudocode function that can check if a given number n is prime or not, where n > 1.

Sure, here is a pseudocode for checking if a number is prime:

Function isPrime(n)
    if n <= 1 then
        return false
    end if

    if n <= 3 then
        return true
    end if

    if n mod 2 = 0 or n mod 3 = 0 then
        return false
    end if

    i = 5
    while i * i <= n do
        if n mod i = 0 or n mod (i + 2) = 0 then
            return false
        end if
        i = i + 6
    end while

    return true
End Function

This function works by first checking if the number is less than or equal to 1, in which case it is not prime. Then it checks if the number is less than or equal to 3, in which case it is prime. Then it checks if the number is divisible by 2 or 3, in which case it is not prime. Finally, it checks if the number is divisible by any number from 5 to the square root of the number, in steps of 6. If it is, then the number is not prime. If it passes all these checks, then the number is prime.