On May 3, 1:00 am, Bill Hart <goodwillh...@googlemail.com> wrote: > I think the unsigned long int is correct this time. I see no reason > why the remove function should return a number of bits.
Well, if the factor being removed is 2, the number of times you can factor it out of a number with n+1 bits like 2^n is... -- You received this message because you are subscribed to the Google Groups "mpir-devel" group. To post to this group, send email to mpir-devel@googlegroups.com. To unsubscribe from this group, send email to mpir-devel+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/mpir-devel?hl=en.
