Say that I have an ordered list of numbers. I want to find the element/s in this list such that the difference between this element and the one that follows it is the maximum distance between each and every pair of consecutive elements in the list.

ie/

I've found the maximum difference between consecutive members of the list by the following;

M:=sort(M);
H:=max({seq(M[i]-M[i-1],i=2..nops(M))});

I now want to know which specific M[i-1...

 Hi hi,

I've been sourcing various codes to help with plotting gaussian primes. I've managed a plot of gaussian primes within a given range with no problem at all. However, I'm looking now to make a plot of all gaussian primes connected by a step k or less to help communicate the Gaussian moat problem.  ( similar to figure 2 in http://mathdl.maa...