[seqfan] Re: For bit fiddlers only
timeroot.alex at gmail.com
Tue Dec 31 21:22:27 CET 2013
All of these numbers will stay finite even for an infinitely large
2's-completement integer. There's no need to stay restricted to 32-bits,
the sequence remains well-defined.
~6 out of 5 statisticians say that the
number of statistics that either make
no sense or use ridiculous timescales
at all has dropped over 164% in the
last 5.62474396842 years.
On Tue, Dec 31, 2013 at 6:15 AM, Peter Luschny <peter.luschny at gmail.com>wrote:
> >> Assuming C operators.
> >> x = 3
> >> [start]
> >> print x
> >> s = x & -x
> >> r = x + s
> >> o = x ^ r
> >> o = (o >> 2) / s
> >> x = r | o
> >> goto [start]
> > What is the datatype of x ?
> 'unsigned int' in C parlance.
> Seqfan Mailing list - http://list.seqfan.eu/
More information about the SeqFan