IMO Ans is D

Stmt I

z = x^n - 19

it will always be a multiple of 9

when n = 1, z = -0009
when n = 2, z = 0081
when n = 3, z = 0981
when n = 4, z = 9981

if you observe the pattern here, the units digit is always 1 and the tens digit is 8 and the other digits will either be 0 or 9 (except when n =1)

the sum of digits of any such number will always be divisible by 9

Sufficient

Stmt II

z + 981 is a multiple of 9

z/9 + 981/9 = Integer
z/9 + 109 = Integer

therefore z/9 has to be an integer to satisfy the equation. Hence z has to be evenly divisible of 9

Sufficient

D

just one correction to sacx

for n=1 z = -9 which does not follow the pattern.

From n>2 it will always follow the pattern of 9* 10^n-1 +81

Cubicle, you're right. Yet, is -9 a multiple of 9?

thanks cubicle_bound_misfit

I have edited my previous post

The question reads "is z divisible by 9" this should not be taken as "is z a multiple of 9", for the reason that when we look for the multiples of a positive integer, we look for the positive integers only, whereas while checking divisibility, we do not mind sign, we only make sure that when the absolute value of the integer (z here) is divided by 9, the remainder is zero. So when we put x = 10 and n = 1, we get 10 ^ 1 - 19 = -9, which is divisible by 9, and hence it is not violating the so called pattern!

IMO D as well.
Followed same procedure/logic as that of sacx.

Thanks for the excellent explanations everyone.