Set of Binary Strings Proof

by Dino Dan   Last Updated October 10, 2019 03:20 AM - source

Say that S contains binary strings of length n st. no two strings in S differ in exactly one position.

How would I prove that S contains no more then 2^(n-1) strings (Note n can be any positive integer)

Can't seem to find a way to do even start this problem.



Related Questions




Modeling counting problems - Proof verification

Updated July 10, 2018 21:20 PM