Re: Number of Differing Digits & Another Problem (want to see different ways it can be done)

*To*: mathgroup at smc.vnet.net*Subject*: [mg76367] Re: Number of Differing Digits & Another Problem (want to see different ways it can be done)*From*: osbornc at gmail.com*Date*: Sun, 20 May 2007 02:37:47 -0400 (EDT)*References*: <f2mf5b$mbm$1@smc.vnet.net>

On May 19, 4:14 am, VenDi... at gmail.com wrote: > I just purchased a copy of Mathematica and I've been learning it for > about a week now. You can expect that I will be posting a lot of > questions. One thing I've noticed is that there are so many different > ways to do the same thing! > > Here is a function I came up with that calculates how many binary > digits two numbers differ in: > > BitDifferences[a_, b_, n_] := > Count[Equal @@@ > Thread[{IntegerDigits[a, 2, n], IntegerDigits[b, 2, n]}], True] > > For example 5 = 101 differs from 6 = 111 by one digit (the middle > digit). > > I want to see how you would do it so I can broaden my Mathematica > perspective. > > Thanks. Hi, If you have version 6.0, check out the function HammingDistance. Chris