The k-dimensional Piatetski-Shapiro prime number problem for k greater than
or equal to 3 is studied. Let pi(x(i)c(1),(...),c(kappa)) denote the numbe
r of primes p with p less than or equal to x, p = [n(1)(c1)] = [ n(k)(ck)],
where 1 < c(1) <(...)< c(k) are fixed constants. It is proved that pi(x; c
(1),(...),c(k)) has an asymptotic formula if c(1)(-1) +(...)+ c(k)(-1) > k
- k/(4k(2) + 2).