Talk:Non-decimal radices/Convert: Difference between revisions
m (added a general query/comment. ~~~) |
m (corrected a typo ] --> ) and added a comment on common fractions. -- ~~~~) |
||
| Line 1: | Line 1: | ||
I think it would be a good idea to add another task in the same manner as this one, but the task would require a much more robust algorithm, supporting (among other things), signed |
I think it would be a good idea to add another task in the same manner as this one, but the task would require a much more robust algorithm, supporting (among other things), signed |
||
numbers) and most important of all, numbers with (decimal) fractions. |
numbers) and most important of all, numbers with (decimal or other bases) fractions. |
||
<br>The task could be to show pi and e (both having, say, 70 digits at least) expressed in binary, hexadecimal and (say), base 62 (with lower- and uppercase alphabetic characters supported in addition to the usual numerals). |
<br>The task could be to show pi and e (both having, say, 70 digits at least) expressed in binary, hexadecimal and (say), base 62 (with lower- and uppercase alphabetic characters supported in addition to the usual numerals). |
||
<br>Also, showing some common fractions (1/3, 1/7) in various bases would be interesting. |
|||
<br>Also, for extra credit, support extremely large bases, say (1k, 10k, 1g, etc). |
<br>Also, for extra credit, support extremely large bases, say (1k, 10k, 1g, etc). |
||
<br>Using glyphs is out of the question, but the "digits" (as I have already coded a REXX program) are bracketed "digits", such as [147][23] |
<br>Using glyphs is out of the question, but the "digits" (as I have already coded a REXX program) are bracketed "digits", such as [147][23] |
||
<br>which for base 1g, would be 147,000,000,023 in base 10. |
<br>which for base 1g, would be 147,000,000,023 in base 10. |
||
<br>(The brackets can be user-specified. |
<br>(The brackets can be user-specified.) |
||
<br>Also supported could be a special base {-26} where A=1, B=2, ... Z=26 --- for interest by certain game enthusiasts and/or amateur cyptogrammers.) --- [[User:Gerard Schildberger|Gerard Schildberger]] |
<br>Also supported could be a special base {-26} where A=1, B=2, ... Z=26 --- for interest by certain game enthusiasts and/or amateur cyptogrammers.) --- [[User:Gerard Schildberger|Gerard Schildberger]] |
||
Revision as of 04:40, 26 March 2012
I think it would be a good idea to add another task in the same manner as this one, but the task would require a much more robust algorithm, supporting (among other things), signed
numbers) and most important of all, numbers with (decimal or other bases) fractions.
The task could be to show pi and e (both having, say, 70 digits at least) expressed in binary, hexadecimal and (say), base 62 (with lower- and uppercase alphabetic characters supported in addition to the usual numerals).
Also, showing some common fractions (1/3, 1/7) in various bases would be interesting.
Also, for extra credit, support extremely large bases, say (1k, 10k, 1g, etc).
Using glyphs is out of the question, but the "digits" (as I have already coded a REXX program) are bracketed "digits", such as [147][23]
which for base 1g, would be 147,000,000,023 in base 10.
(The brackets can be user-specified.)
Also supported could be a special base {-26} where A=1, B=2, ... Z=26 --- for interest by certain game enthusiasts and/or amateur cyptogrammers.) --- Gerard Schildberger