Re: prime numbers and African artifact

Peter Seebach (
15 Jul 1995 01:00:41 -0500

In article <3u6jjq$f0m@bubba.NMSU.Edu>,
David Wayne McKee <> wrote:
>Peter Seebach ( 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.)


> ** ALL integers can represented in ANY positive integer base **

>(are there negative bases, or non-integer ones?). The issue of finite
>representation only comes up with the fractional parts of rational

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 power-expensive 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?


Peter Seebach - --
All the arrogant jerks who object to stereotypes are all alike.
C/Unix proto-wizard -- C/Unix questions? Send mail for help.
Copyright 1995 Peter Seebach. Not for distribution through Microsoft Network.