/sci/ - Science & Math

>>14823758
Let's look at the first line.
We have [math]f(n) = lg(n)[/math]. We want to find the largest [math]n[/math] such that [math]f(n) = lg(n)[/math] is smaller than a second, a day and a century.
So we turn inequalities into equalities and then apply floor functions. [math]lg(n) = 10^6[/math], so [math]n = 2^{10^6}[/math], which is conveniently already an integer, and so on and so forth for the remainder.
>These should be fairly close, say within 10%
The [math]n[/math] you give needs to be within [math]10%[/math] from the correct [math]n[/math]