Let be an -uniform hypergraph. Let be a subset of vertices and define .
We say that is -divisible if for every -subset of , . (We assume that ).
Given positive integers , and a prime power, we prove that if is an -uniform hypergraph and , then contains a nontrivial subhypergraph which is -divisible.