We define an arithmetical function, f(n), which gives a lower bound for the rank of elliptic curves, y2 = x3 + nx, n square-free. Thus, if f(n) is unbounded for square-free values of n, then there are elliptic curves of arbitrarily large rank. We show that f(n) is unbounded as n ranges over all integers.