Path: utzoo!censor!geac!torsqnt!news-server.csri.toronto.edu!rutgers!sun-barr!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!sdd.hp.com!hp-pcd!hpcvra.cv.hp.com!rnews!hpcvbbs!akcs.scotty
From: akcs.scotty@hpcvbbs.UUCP (SCOTTY THOMPSON)
Newsgroups: comp.sys.handhelds
Subject: 32 Bt Mant is < I need!
Message-ID: <276057f4:1381comp.sys.handhelds@hpcvbbs.UUCP>
Date: 8 Dec 90 03:40:05 GMT
Lines: 25

I need help.  Using binary numbers on my 48SX and trying to raise 2
to the nth power to test a flag has become a difficult and unneccessary
chore.

When I have large binary numbers and I want to test a bit in that number
using the binary AND command, from within a loop or controled from a
variable (so I can't just have a big list and pick, enter and choose),
I can't get a number that big with floating point because the mantissa
is only 32 bits.  There are large differences in errors.

I could shift the original #, but the overhead is rediculous and slows
down my "thought" processes considerably, since I have to test 'i' and
figure-out what to shift and the like.

Does anyone out there have any work-arounds to a 32 bit mantissa when
you need to get a very large (try comparing a large binary number
converted to REAL with a REAL generated with the x^y function) binary
number from a REAL?  I don't really think anyone has really addressed
this, 'cause it's easy to get an accurate real from a binary but not
the inverse.

Any help ASAP would be greatly appreciated, since I am now at a
standstill and don't really want to find a million work-arounds until
I hear if there is an easy and expedient method for doing the same thing.

Thanks...Scotty (213) 539-3611 (Wk), 539-9780 (Hm)