08-01-2005 02:17 PM
08-01-2005 02:18 PM
08-02-2005 10:40 AM
08-02-2005 01:21 PM
08-02-2005 01:31 PM - edited 08-02-2005 01:31 PM
Message Edited by Novatron on 08-02-2005 02:32 PM
08-02-2005 06:49 PM
08-02-2005 07:59 PM
05-01-2020 04:50 AM
I was working in a different mathematical field. Unintentionally, I discovered two ways to convert numbers to Gray code. Example with 173 (8 digits in binary system); from right to left: I make the divisions of 173 with the numbers 2,4,8,16,32, ..., 256. I round each quotient to the nearest integer. I am writing this integer down from the corresponding fraction. If this integer is even, then I write below this digit 0, otherwise I write the digit 1. These digits form the Gray code of 173: 11111011
..........................173...........................
___________________________________
256 128 064 032 016 008 004 002
001 001 003 005 011 022 043 087
....1.......1.....1.....1.....1.....0.....1......1
Faster method. I can convert all numbers that have equal lengths of digits in the binary system to Gray codes. I do this without turning any number into binary. Here I find it difficult to present this method because it contains graphs, but you can find this here:
http://viXra.org/abs/2004.0456?ref=11278286