Path: utzoo!utgpu!news-server.csri.toronto.edu!rutgers!mit-eddie!bloom-beacon!eru!hagbard!sunic!news.funet.fi!funic!fuug!tuura!risto
From: risto@tuura.UUCP (Risto Lankinen)
Newsgroups: comp.lang.c
Subject: Re: % operator (was Re: count of bits set in a long)
Message-ID: <794@tuura.UUCP>
Date: 2 Oct 90 08:24:46 GMT
References: <37545@ut-emx.uucp> <3820@goanna.cs.rmit.oz.au> <34281@cup.portal.com> <2859@litchi.bbn.com> <51467@brunix.UUCP> <3417@gmdzi.gm
Organization: Nokia Data Systems Oy
Lines: 14


Oops!

*JUST* having sent the article claiming that Parity(x) would be equal to
Mod(x,1) , I made a second thought.  It is not so, since the result of the
algorithm I showed will be '1' for any 'x!=0' because no two positive
numbers yield zero when added one another.

Terveisin: Risto Lankinen
-- 
Risto Lankinen / product specialist ***************************************
Nokia Data Systems, Technology Dept *  2                              2   *
THIS SPACE INTENTIONALLY LEFT BLANK * 2 -1 is PRIME!  Now working on 2 +1 *
replies: risto@yj.data.nokia.fi     ***************************************