[GAP Forum] Thue's Lemma

[Sergey Shpectorov]

Dear Frank,

Yes, this is exactly what I need!! And it seems to work well for very-very long numbers!

All the best,
Sergey

  
________________________________________
From: Frank Lübeck [frank.luebeck at math.rwth-aachen.de]
Sent: Thursday, July 28, 2016 1:16 PM
To: Sergey Shpectorov
Cc: forum at gap-system.org
Subject: Re: [GAP Forum] Thue's Lemma

On Wed, Jul 27, 2016 at 03:49:39PM +0000, Sergey Shpectorov wrote:
> Hello,
>
> Does GAP have a function for Thue's Lemma:
>
> Given integers m>1, X>0, Y>0, such that X<=m<XY, and an integer a,
> there exist integers
> x,y such that |x|<X, 0<y<Y, and ay=x mod m.
>
> or something equivalent?
>
> Best,
> Sergey

Dear Sergey, dear Forum,

See the documentation of the function

?RatNumberFromModular

which is contained in the EDIM package.

Does this what you are looking for? (When I wrote that function I was not
aware that this is known under various names.)

Best regards,
   Frank
--
///  Dr. Frank Lübeck, Lehrstuhl D für Mathematik, Pontdriesch 14/16,
\\\                    52062 Aachen, Germany
///  E-mail: Frank.Luebeck at Math.RWTH-Aachen.De
\\\  WWW:    http://www.math.rwth-aachen.de/~Frank.Luebeck/