Determine all possible pair(s) of nonnegative integers (P, Q), that satisfy this equation:

                                         2^P = 3^Q + 5

(In reply to re(2): Charlie --asking more by Ady TZIDON)

I don't know the algorithm used for 2^1000 for example, but I'm pretty sure it doesn't use logarithms, as, if it did, I'd expect less accuracy (i.e., not perfect accuracy) at least for some n in 2^n.

list
    5   T=time1000
   10   for I=1000 to 6000
   20    X=2^I
   30   next
   50   print time1000-T
OK
run
 103
OK

indicates 103 milliseconds for that run on a 2 GHz processor. However, my 4 GHz processor is much more than twice as fast at other things, so it depends on more than just the GHz.

There's a Wikipedia article on UBASIC, with links at the bottom for obtaining it.

Posted by Charlie on 2008-10-05 19:12:03