![]() |
Where did that 37 come from
At a party yesterday, my friend Simon commented that it was silly to display baud-rates in hex, since decimal 38400 comes out in hex as 0x9600 and causes confusion.
That is, 9600 is a number for which 'read as if it were in hex' and 'multiply by four' are the same operation. 154231124 is a number for which 'read as if it were in hex' and 'multiply by 37' are the same operation. Likewise 224321889 [41] 187605873 [35] and 17996800 [22]. multipliers I have observed are 4, 6, 10, 16, 22, 25, 35, 37, 40, 41 (twice! 224321889 and 789458685), 42, 56, 61 (1365665301), 64, 65 (3502669923), 66 (1067455668), 67 (4251168226) ... this is an unnatural set of numbers but I suppose read-as-if-it-were-in-hex is an unnatural operation. of course 11702482 [25] implies 117024820 [40] and 1170248200 [64] 187605873 [35] implies 1876058730 [56] |
[QUOTE=fivemack;269918]At a party yesterday, my friend Simon commented that it was silly to display baud-rates in hex, since decimal 38400 comes out in hex as 0x9600 and causes confusion.
That is, 9600 is a number for which 'read as if it were in hex' and 'multiply by four' are the same operation. 154231124 is a number for which 'read as if it were in hex' and 'multiply by 37' are the same operation. Likewise 224321889 [41] 187605873 [35] and 17996800 [22]. multipliers I have observed are 4, 6, 10, 16, 22, 25, 35, 37, 40, 41 (twice! 187605873 and 789458685), 42, 56, 61 (1365665301), 64, 65 (3502669923), 66 (1067455668), 67 (4251168226) ... this is an unnatural set of numbers but I suppose read-as-if-it-were-in-hex is an unnatural operation. of course 11702482 [25] implies 117024820 [40] and 1170248200 [64] 187605873 [35] implies 1876058730 [56][/QUOTE]And, of course, Halloween is the same as Christmas Day. (Yes, the old ones are the best.) Paul [spoiler]31 OCT == 25 DEC[/spoiler] |
[QUOTE=fivemack;269918]At a party yesterday, my friend Simon commented that it was silly to display baud-rates in hex, since decimal 38400 comes out in hex as 0x9600 and causes confusion.
That is, 9600 is a number for which 'read as if it were in hex' and 'multiply by four' are the same operation. 154231124 is a number for which 'read as if it were in hex' and 'multiply by 37' are the same operation. Likewise 224321889 [41] 187605873 [35] and 17996800 [22]. multipliers I have observed are 4, 6, 10, 16, 22, 25, 35, 37, 40, 41 (twice! 187605873 and 789458685), 42, 56, 61 (1365665301), 64, 65 (3502669923), 66 (1067455668), 67 (4251168226) ... this is an unnatural set of numbers but I suppose read-as-if-it-were-in-hex is an unnatural operation. of course 11702482 [25] implies 117024820 [40] and 1170248200 [64] 187605873 [35] implies 1876058730 [56][/QUOTE] I'm confused ?? is there a link to an explanation somewhere of what is meant ? |
[QUOTE=science_man_88;269947]I'm confused ?? is there a link to an explanation somewhere of what is meant ?[/QUOTE]
9600 * 4 = 38400, and 0x9600 (the way programmers write 9600_16 or "9600 in hexadecimal") is also 38400 = 0 * 16^0 + 0 * 16^1 + 6 * 16^2 + 9 * 16^3. |
[QUOTE=CRGreathouse;269962]9600 * 4 = 38400, and 0x9600 (the way programmers write 9600_16 or "9600 in hexadecimal") is also 38400 = 0 * 16^0 + 0 * 16^1 + 6 * 16^2 + 9 * 16^3.[/QUOTE]
thanks should I make a pari code to figure out sequences ? |
I've taken this in C++ code to about 2.5e12 for several bases, so probably there's little point writing very much pari. The smallest working-example for base 11 is amusingly enormous (it's a tripling). Next interesting question is whether there are better search techniques than just counting.
You're looking for a short vector in the integer lattice perpendicular to some other vector, but I'm not sure how you encode 'non-negative' for lattice problems; might well be able to do dynamic programming and get an answer for any given multiplier much more quickly than just counting. |
[QUOTE=xilman;269946]And, of course, Halloween is the same as Christmas Day.
(Yes, the old ones are the best.) Paul [spoiler]31 OCT == 25 DEC[/spoiler][/QUOTE] Would you care to explain how Halloween is the same as (or equivalent to) Christmas Day? The spoiler answer didn't help me. The problem posed by fivemack is a very interesting one. The question is: Did he really hear such a problem at a party? :-) |
that's 31 (octal) is 25 (decimal), a very old joke. But the problem is quite interesting, and I would also like to read some math behind. I stucked my ears into it, but without any relevant result.
|
It's like:
"There are 10 kinds of people in the world — those who understand binary and those who don't." |
[QUOTE=fivemack;270049]
You're looking for a short vector in the integer lattice perpendicular to some other vector, but I'm not sure how you encode 'non-negative' for lattice problems; might well be able to do dynamic programming and get an answer for any given multiplier much more quickly than just counting.[/QUOTE] This is something I've wondered about for quite a while: has there been any work on 'constrained' lattice reduction? i.e. finding a small vector in a lattice even though conventional 'approximate orthogonalization' techniques are not allowed? This has a lot of bearing on several aspects of NFS polynomial selection... I also wonder if the best one can do involves techniques that look like the branch-and-bound techniques from integer programming. |
[QUOTE=LaurV;270296]that's 31 (octal) is 25 (decimal), a very old joke. But the problem is quite interesting, and I would also like to read some math behind.[/QUOTE]
Thanks. That explains it. [QUOTE=LaurV;270296] I stucked my ears into it... [/QUOTE] I think the English phrase that you are looking for is "I put my head to it". :-) [QUOTE=kar_bon;270300]It's like: "There are 10 kinds of people in the world — those who understand binary and those who don't."[/QUOTE] That's funny. I had not heard either one of these before. :smile: |
| All times are UTC. The time now is 21:34. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.