```python
def is_majority(arr, n, x):
    """
    Checks if an element x is a majority element in a sorted array arr.
    A majority element is an element that appears more than n/2 times.

    Args:
        arr: A sorted list of numbers.
        n: The size of the array.
        x: The element to check.

    Returns:
        True if x is a majority element, False otherwise.
    """
    if n == 0:
        return False

    # Find the first occurrence of x using binary search
    low = 0
    high = n - 1
    first_index = -1

    while low <= high:
        mid = low + (high - low) // 2
        if arr[mid] == x:
            first_index = mid
            high = mid - 1  # Continue searching in the left half
        elif arr[mid] < x:
            low = mid + 1
        else:
            high = mid - 1

    # If x is not found, it cannot be the majority element
    if first_index == -1:
        return False

    # If x is a majority element, then the element at index
    # (first_index + n/2) must also be x.
    # We also need to check if this index is within the array bounds.
    majority_check_index = first_index + n // 2

    return majority_check_index < n and arr[majority_check_index] == x
```