cnt. ... log(3)

 First of all,

3  =  2 * (3/2)

and

2  =  (3/2) *(4/3)

hence

3 =  (3/2)^2 * (4/3)

but

3/2  =  (4/3) * (9/8)

and finally:

3  =  (4/3)^3 * (9/8)^2

In other words:

log(3)  =  3*log(4/3) + 2*log(9/8)


Thus, a computation of  log(3)  is virtually as fast as that of  log(2) (see the previous note: https://whmth.blogspot.com/2024/05/near-1-fractions-and-computing-log2.html).


Comments

Post a Comment

Popular posts from this blog

Baroque numbers (a new start)

Introduction  Perfect numbers were recognized and fairly popular for millennia, especially the first perfect number  6 where 2*6  =  1+2+3+6 -- here to the right of sign = we see all divisors of  6. Less popular were the multiply perfect numbers such as 120, where 3 * 120   =   1+2+4+8  +  3+6+12+24  +  5+10+20+40  +  15+30+60+120 -- here to the right of sign = we see all divisors of  120; indeed: 1+2+4+8  +  3+6+12+24  +  5+10+20+40  +  15+30+60+120  = (1+2+4+8) * (1+3+5+15)  = 15 * 24  =  360  = 3 * 120 The other common names in the literature of   multiply perfect numbers   are   multiperfect number,   and    pluperfect number . However, years ago in place of these names I have introduced: baroque numbers I'll provide the related definitions and elementary properties in what follows. The sum of divisors funct...
Read more

Near 1 fractions and computing log(2)

 Near 1 fractions are: 2/1   3/2   4/3  5/4  ... i.e. fractions  (n+1)/n  where  n  is an arbitrary natural number. When  n  gets larger, there is a tendency for a computation of  log(n) to get faster while a direct computation of  log(2)  is relatively slow. Thus, in order to speed up computing  log(2)  we may try to represent  2  as a product of near 1 fractions that have large denominators (hence numerators too). Let's start modestly: 2  =  (3/2) * (4/3) hence log(2)  =  log(3/2) + log(4/3) One should be able to compute  log(3/2)  faster than  log(2);  and a computation of  log(4/3)  should be still faster. However, it's not clear that computing both logarithms  log(3/2)  and  log(4/3) takes less time than the single direct calculation of  log(2). So, we would like to use fractions with larger denominators. There is...
Read more

(2 3 5 7)-fractions

Introduction A (2 3 5 7)-fraction is any fraction  (n+1)/n  such that  n  is a natural number (1 2 3 ...), and  n*(n+1) has no prime divisor > 7. Thus (2 3 5 7)-fractions form a subset of all near 1 fractions, see   https://whmth.blogspot.com/2024/05/near-1-fractions-and-computing-log2.html Earlier, in   https://whmth.blogspot.com/2024/05/team-2-3-5.html I listed all (2 3 5)-fractions, i.e. all fraction  (n+1)/n  such that  n  is a natural number (1 2 3 ...), and  n*(n+1) has no prime divisor > 5.  Obviously, the (2 3 5)-fractions form a subset of the set of all (2 3 5 7)-fractions. We saw that there are exactly 10 different (2 3 5)-fractions. A much more extensive table of near 1 fractions was included in a paper by D.H.Lehmer, see   https://whmth.blogspot.com/2024/05/dhlehmers-extensive-table-of-near-1.html The table of the (2 3 5 7)-fractions Either the numerator ot the denominator (or both) of a (2 3 5 ...
Read more