A simple proof for the following?
From: c.j[dot]w (_at_telia.com)
Date: 11/20/04
- Next message: Mos: "Re: Longest Thread Ever"
- Previous message: Eray Ozkural exa: "Re: Is this math test too easy?"
- Next in thread: Josh Purinton: "Re: A simple proof for the following?"
- Reply: Josh Purinton: "Re: A simple proof for the following?"
- Reply: KRamsay: "Re: A simple proof for the following?"
- Messages sorted by: [ date ] [ thread ]
Date: Sat, 20 Nov 2004 18:44:57 +0100
Hello,
Is there for the following statement a simple proof (or a way to show
that it is plausible)?
Statement: Any 8-bit word can be stored as a 14-bit word, with the
14-bit word having at least two zeros between every one.
Thanks in advance,
Carl
- Next message: Mos: "Re: Longest Thread Ever"
- Previous message: Eray Ozkural exa: "Re: Is this math test too easy?"
- Next in thread: Josh Purinton: "Re: A simple proof for the following?"
- Reply: Josh Purinton: "Re: A simple proof for the following?"
- Reply: KRamsay: "Re: A simple proof for the following?"
- Messages sorted by: [ date ] [ thread ]