PrintFactorsInt(<integer>) is the command you want, as described here
http://www.gap-system.org/Manuals/doc/ref/chap14.html#X82C989DB84744B36 So PrintFactorsInt(600); displays 2^3*3*5^2 I’m not sure what your other question is exactly. You want to use Fermat’s little theorem to test whether a given integer is a prime? Sandeep Murthy s.mur...@mykolab.com > On 15 Apr 2015, at 16:53, Wanderley Tiowann <sgwvie...@gmail.com> wrote: > > Hi, > > 1) Thanks for your help. But I need to do more exercises. > I have to do an algorithm to show Little Theorem Fermat. Can you give me one > exemple? > > 2) How can I factor 600 in GAP and put it in this way = 2^3*3*5^2? > >
_______________________________________________ Forum mailing list Forum@mail.gap-system.org http://mail.gap-system.org/mailman/listinfo/forum
