On 20 December 2010 20:48, Torbjorn Granlund <tg at gmplib.org> wrote: > Necati Demir <ndemir at demir.web.tr> writes: > > ... > > I'd assume it'd mean to compute x*2^k mod (2^n-1) where n is the word > bit count. There is no direct function for that, but it should not hard > to program it using the existing function. > what is k?