- #1
guifb99
- 10
- 1
½Logb(x2-1)≈logb(x)
This is an easy and useful way to calculate the log of any natural number, including primes, it won't ever give a precise result, obviously (because of the -1), but as "x2-1" will always have divisors smaller than "x", you can easily calculate the approximation by using the property that logc(a*b)=logc(a) + logc(b).
It could actually just be n-1logb(xn-k)≈logb(x) but it would be harder to calculate depending on which "k" or which "n" you use and won't be as useful for school purposes.
Obviously, since ½logb(x2)=logb(x), the closer "k" is to 0, the more precise the result will be. And the closer "n" is to infinity, also the more precise the result will be, since the value of "k" will become less and less significant as "xn" gets bigger.
*It's good to notice that for a "k" bigger than one, it will fail miserably.
This is an easy and useful way to calculate the log of any natural number, including primes, it won't ever give a precise result, obviously (because of the -1), but as "x2-1" will always have divisors smaller than "x", you can easily calculate the approximation by using the property that logc(a*b)=logc(a) + logc(b).
It could actually just be n-1logb(xn-k)≈logb(x) but it would be harder to calculate depending on which "k" or which "n" you use and won't be as useful for school purposes.
Obviously, since ½logb(x2)=logb(x), the closer "k" is to 0, the more precise the result will be. And the closer "n" is to infinity, also the more precise the result will be, since the value of "k" will become less and less significant as "xn" gets bigger.
*It's good to notice that for a "k" bigger than one, it will fail miserably.