Post by Devantè on Oct 15, 2006 10:50:23 GMT -5
Let n=6->6->6->6->6
Let n1 equal to the smallest number apart from zero and one which is a perfect square, cube, fourth, fifth, sixth and nth power.
n1+1 is a prime number.
Proof:- n1-1 is divisible to almost any prime number, because of the fact that (a^n-b^n) is divisible by (a-b).
This is a better proof than Graham's Number for Ramsay theory, he he
Such numbers are enormously large.
For example, the smallest number apart from zero and one which is a perfect square, cube, fourth, fifht and sixth power is 1152921504606846976.
(That is how many bytes make an exabyte).
And extrapolating this to tenths power, the result is 3.940842x10^758, a number containing 759 digits.
If this is extrapolated to 20th power, the result is 2.125219 x 10^70077543 approximately, containg 70077544 digits.
And when this extrapolated to 1000th power, the result is 10^10^433, much much larger than a googolplex
Let n1 equal to the smallest number apart from zero and one which is a perfect square, cube, fourth, fifth, sixth and nth power.
n1+1 is a prime number.
Proof:- n1-1 is divisible to almost any prime number, because of the fact that (a^n-b^n) is divisible by (a-b).
This is a better proof than Graham's Number for Ramsay theory, he he
Such numbers are enormously large.
For example, the smallest number apart from zero and one which is a perfect square, cube, fourth, fifht and sixth power is 1152921504606846976.
(That is how many bytes make an exabyte).
And extrapolating this to tenths power, the result is 3.940842x10^758, a number containing 759 digits.
If this is extrapolated to 20th power, the result is 2.125219 x 10^70077543 approximately, containg 70077544 digits.
And when this extrapolated to 1000th power, the result is 10^10^433, much much larger than a googolplex