```python
def permutation_coefficient(n, k):
    """
    Calculates the permutation coefficient P(n, k).

    P(n, k) represents the number of ways to choose an ordered set of k elements
    from a set of n elements.
    The formula is P(n, k) = n! / (n - k)!.
    This can be calculated more efficiently as n * (n - 1) * ... * (n - k + 1).
    """
    # By definition, k cannot be greater than n or be negative.
    # In such cases, the number of permutations is 0.
    if k < 0 or k > n:
        return 0

    # P(n, 0) is always 1.
    if k == 0:
        return 1

    # Calculate the product: n * (n - 1) * ... * (n - k + 1)
    result = 1
    for i in range(k):
        result *= (n - i)

    return result
```