Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Possible Duplicate:
Comp Sci Math; Hamming Distance

I have been set a task:

What is the maxium possble Hamming distace between two noes from level i in an n-cube? Provide an explanation for your answer!

share|cite|improve this question

marked as duplicate by J. M., Jyrki Lahtonen, Asaf Karagila, t.b., Did Oct 9 '11 at 9:27

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

Asked and answered here – Dilip Sarwate Oct 7 '11 at 12:48
Well spotted, @Dilip. Voting to close as a dup. – Jyrki Lahtonen Oct 7 '11 at 12:54

The discription fore homework says "show sufficient effort". Well I don't think that this is the case... ;)

Anyway I think it would help yourself if you draw a square (which is a 2-cube) and try to find out the distance between the nodes (don't forget the diagonale). Afterwords try to generalize it to a n-cube.

share|cite|improve this answer
What exactly is a "level"? – user17262 Oct 7 '11 at 12:46
@David, The word level is in the statement of the homework. Presumably the homework is given in the frame of a course. But level was not defined in the course? – Did Oct 7 '11 at 12:49
@David Don't you think that you should tell us, what a "level" is? Hardly anything standard! If coerced to answer, I would hazard a guess that level $i$ consists of the nodes at Hamming distance $i$ from a given reference node, but that is just a guess. Think "triangle inequality", but also remember that there is a maximum to the Hamming distance on an $n$-cube. Or that "level" $i$ is (if I guessed correctly) the same set of points that forms "level" $n-i$ when viewed from the exact opposite reference point. – Jyrki Lahtonen Oct 7 '11 at 12:50