[seqfan] Re: Monotonic ordering of nonnegative differences

[Neil Sloane]

Don,  That sounds excellent, but don't really understand what you did.
Could you spell it out
in more detail?

Best regards
Neil

Neil J. A. Sloane, President, OEIS Foundation.
11 South Adelaide Avenue, Highland Park, NJ 08904, USA.
Also Visiting Scientist, Math. Dept., Rutgers University, Piscataway, NJ.
Phone: 732 828 6098; home page: http://NeilSloane.com
Email: njasloane at gmail.com



On Fri, Oct 11, 2019 at 5:50 PM Don Reble via SeqFan <seqfan at list.seqfan.eu>
wrote:

> > 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
>
>
> --
> Seqfan Mailing list - http://list.seqfan.eu/
>