Latest update

- pgfplots addplot+: Position pins on same line
- Page number at a different position on every page. How to force it to the same format
- biblatex long url extending into border despite using biburllcpenalty
- Block zoom level in QGIS
- Is there a way to calculate a viewshed from n number of points? e.g., what is the cumulative viewshed when using each corner of a building
- Customizing MacBook Pro Touchbar for QGIS
- Dead GFCI outlet(s), wire is live
- How do I connect a Juno LED light to a switch when the light receives power first?
- Use wood stove in fireplae until the pipe is hooked up and chimney lined
- Can't move the Sharkbite fitting to the right over the other end of the pipe
- 16“ center bracket to 24” center framing
- Can I add a receptacle from a bath fan switch box?
- Can Someone Help Me Identify This Switch?
- Small door on window screen
- Get ring because the door will need one
- What is the correct term for insulated glass?
- Definite integral of derivative of function
- Invariant subspace concept - generalization
- How does hyper-plane equation divide vector space into cells convex polyhedrons?
- Proof that bounded right continuous functions are integrable.

# Is 3 bits difference enough to map distinct values toggling a single bit in a binary number?

2018-10-20 13:34:57

Assume that one can only alter a single bit in a binary number set. As in:

00000000

can be converted to one of the rows in:

00000001

00000010

00000100

00001000

00010000

00100000

01000000

10000000

If one has the set 00000000, 00000111 all 16 conversions(mappings) will be distinct. How to prove, or disprove, that:

If any of the numbers in the set has at least 3-bits of difference, the values they map to will be distinct.

?