[seqfan] Re: Monotonic ordering of nonnegative differences

[Don Reble]

> I know two methods of proving that 3^m-2^n=k for a given k is insoluble
> in m,k. First is to find a suitable M (if it exists) such that the
> congruence 3^m-2^n == k (mod M) is insoluble (which is easy to verify).
    -- Max Alekseyev

> If we had [more info from Max], then we could delete the dubious
> programs in A173671.
    -- njas

    The complement of A173671 is A192111.
    Inspired by Max's A075824 comment, I find that modulus 144331387200
    helps to verify the odd gaps in A192111's B-file, up to 2234207.
    (The even gaps are trivial.)
    It could be challenging to reach a(1000) ?= 50031545098868635.

-- 
Don Reble  djr at nk.ca