Re: prime numbers and African artifact
Peter Seebach (seebs@solutions.solon.com)
15 Jul 1995 01:00:41 0500
In article <3u6jjq$f0m@bubba.NMSU.Edu>,
David Wayne McKee <dmckee@nmsu.edu> wrote:
>Peter Seebach (seebs@solutions.solon.com) wrote:
>: Duh. It is. It's
>: 110101110111010010110111110...00011000001111001010110111000.
>: What gave you the idea it wasn't representable in binary? All even numbers
>: can be represented in binary. (Most odd numbers can, too. Exceptions are
>: the powers of three... actually, more generally, the only odd numbers that
>: can be represented base two are those that are also multiples of some power
>: of two, so they can be converted over.)
>er...
> ** ALL integers can represented in ANY positive integer base **
>(are there negative bases, or noninteger ones?). The issue of finite
>representation only comes up with the fractional parts of rational
>numbers.
Well, theoretically*, yes, but in general, you have to restrict yourself
to powers of the base, otherwise, you have to use more than one '1'. The
'1's are sufficiently more powerexpensive that you can burn out a
computer using those.
For best results, use only NUL SOH STX EOT BS DLE ' ' and '@'.
Want me to help you get that hook out of your mouth?
s

Peter Seebach  seebs@solon.com  seebs@intran.xerox.com
All the arrogant jerks who object to stereotypes are all alike.
C/Unix protowizard  C/Unix questions? Send mail for help.
Copyright 1995 Peter Seebach. Not for distribution through Microsoft Network.
