Respected Sir ,
Good Morning : Sir is it possible to find natural logarithm of 200 digit number and its antilog also
If yes , then How to find it . Kindly tell.
OK this might take a while...
If you think about a calculator, if you asked it to evaluate for example. Do you think that the calculator immediately knows how to calculate this? Of course not - it's had to have an algorithm programmed into it.
The ONLY operations that a calculator can do are addition, subtraction, multiplication, division and exponentiation. So you would need to tell the calculator what the correct combination of these would give you the value of (say).
To do this, we have to use polynomials, since the general polynomial is the most general combination of the 5 operations.
Let's start with the exponential function (since I like exponentials more than logarithms). We should already know a few things about the exponential function, like:
and .
Let's assume we can write it as a polynomial. Then that means
.
We almost have enough information to program the calculator. We just need to find out what the constants are...
Since we know , if we let in the polynomial that means
.
So we have managed to find one of the constants. Now we need to find a "process" that will reduce the powers and enable us to find the next constant. That process is differentiation. So we will take the derivative of both sides
and by letting we find
.
Take the derivative of both sides
.
Let and we find
.
Take the derivative of both sides
Let to find
.
Take the derivative of both sides
Let to find
.
Are you starting to see a pattern? If we were to keep going we'd find
.
See now you are able to simply substitute any value of you like, say 6, to find , and then simplify the polynomial to whatever accuracy you like. You could do this for ANY value (even ones over 200 digits - it would just take a long time).
So, do you think you might be able to use the same process to find a polynomial (series) to find the logarithm of a number?
Hint: Since is undefined and not differentiable at , you should use as your starting function. You should know that and .
You can never find the exact natural logarithm of an integer greater than 1. But you can get it to any desired degree of accuracy as follows (assuming that you have an accurate enough method for finding the log to base 10 of a number between 1 and 10).
Suppose that x = abcde... is the decimal representation of an integer x consisting of n digits a, b, c, ... . Let L be the logarithm to base 10 of the number a.bcde... (with a decimal point after the a). Then the log to base 10 of x is n – 1 + L. To get the natural logarithm, you multiply the log to base 10 by ln(10).
If you want a very powerful, open source, lightweight calculator that can handle large numbers (actually it is a CAS which is more powerful than a calculator), I recommend PARI/GP. Use \p to set precision, as in "\p 100". If you're using windows, you can use notepad to save your number to a file, such as typing n = 1299271937... and saving as say "number.gp", then from the command prompt (cmd) you can type "gp number.gp" with the appropriate paths, then type log(n), or log(n)/log(b) if you want log in another base. If you're using linux then probably you don't require much tutorial. I have no idea how it works on macs.
Edit: Of course antilog is just exp(n) for given n, or b^n if you are using a base other than e. For a 200 digit number you will get overflow, because for example e^(10^5) is already approximately 2.8e43429.
Sir , thanks , u told abt peri/gp , its an excellent software......
but my project failed. Actually i a trying to find generic solution to factorize a large prime number without involving any group theory , but i failed.... i spend my continueous 45 hours on this .... still i didn't got solution.....
If you are trying to break the RSA encryption, good luck! Factoring a 200 digit number formed as a product of two 100 digit prime numbers should take you about a few million years on your computer. I don't get how taking the logarithm will help you find the factors!