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 _______________________________________________ Forum mailing list Forum@mail.gap-system.org http://mail.gap-system.org/mailman/listinfo/forum
