[seqfan] Re: successive powers of 2 modulo n

[Max Alekseyev]

On Sat, Jun 11, 2011 at 7:59 AM, Jack Brennen <jfb at brennen.net> wrote:

> Note that i/bitand(i,-i) is just a tricky way to divide all powers of 2 out
> of i.

i/2^valuation(i,2) would be more straightforward.

Regards,
Max