Divisibility of Codes Meeting the Griesmer Bound

We prove that if a linear code overGF(p),pa prime, meets the Griesmer bound, then ifpedivides the minimum weight,pedivides all word weights. We present some illustrative applications of this result.