   # How many numbers are there with 10 as the hamming distance and can be represented using 15 bits.

+3 votes
118 views

Hamming distance between two binary numbers is the number of different bits between two numbers. With respect to 0, how many numbers are there with 10 as the hamming distance and can be represented using 15 bits. posted Oct 22, 2013
Share this question

## 1 Answer

+2 votes

For Hamming distance 10 means 10 bit should be different from 15 bit. So there are 15! / 10! * 5! ways to chose 10 bit from 15 bit.

``````15 X 14 X 13 X 12 X 11
-------------------------------   =  3003
5 X 4 X 3 X 2
``````

And 2 value possible for each bit. So total number for Hamming distance 10 = 3003 X 2 = 6006 answer Oct 22, 2013
Please read some permutation combination basic concept. If things are not clear.
Please let me know If I am wrong .
Similar Questions
+2 votes

Hamming distance between two binary number is the number of different bits between the two numbers.
With respect to 0, how many numbers are there with 10 as the hamming distance and can be represented
using 15 bits.

+2 votes

Result should be stored in new linked list.

+7 votes

Input:
First List: 5->6->3 // represents number 563
Second List: 8->4->2 // represents number 842
Output
Resultant list: 4->7->4->0->4->6 // represents number 474046

+2 votes

Provide an algorithm to add and multiply two large integers which cannot be represented by built-in types, C code would be a great help?

+4 votes

Two numbers a and b are said to be co-prime if gcd(a,b) is 1.

Now my question is about the algorithm to find out if given two numbers are co-prime.