Re: Approximation of 2^M to 3^N /could this approach be useful?

From: Gottfried Helms (helms_at_uni-kassel.de)
Date: 09/28/04 

Date: Tue, 28 Sep 2004 13:30:08 +0000 (UTC)

I have to correct my previous (and many other) postings
and to remove the connection to the waring-problem,
since I found an error in my reformulation of

   frac((3/2)^N) <1-(3/4)^N (*)

> from an inequality steming from the waring-problem, I get as
> a very likely, but yet unproven, statement
>
> 1/2^N < frac(2^M/3^N) (9)

In the form of (9), derived from the waring-problem, the rhs
misses an important additive term - sorry.
The low-bound conjectured by (*) -put in an equivalent form
to (9)- is *much* higher.
Sorry for claiming that connection. (This does not affect
the other (collatz-motivated) arguing).

Gottfried Helms