NOTE: This problem statement contains subscripts that may not display properly if viewed outside of the applet.
In mathematics, an arithmetic progression or arithmetic sequence is a sequence of numbers such that the difference of any two successive members of the sequence is a constant. For instance, the sequence 3, 5, 7, 9, 11, 13... is an arithmetic progression with common difference 2. An arithmetic sequence can always be represented as a_{n}=a0+n*d.
You will be given a sequence seq, where seq_{i} = [a_{i+1}] for some nondecreasing arithmetic sequence a (both indices are 0based). [x] denotes the floor function (see Notes). The sequence a is defined as a0+i*d. Return the minimal possible value for d. If no possible value exists for d, return 1 instead.
