I have the following expression
$n^{1/\log(n)}, \quad where \quad n \in [1, 10,000]$.
When I solve this numericall, I get the resultant value 2.718282 for all $n \in [2, 10,000]$. On this basis, I can consider the upper bound 3, means that
$n^{1/\log(n)} < 3 \quad \forall \, n \in [1, 10000]$. The question is that how I can analytically show that the upper bound of this expression is less than 3.
2026-03-31 16:27:33.1774974453
upper bound of a function $n^{1/\log(n)}$
271 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
3
We use the well-known property that $$a^b=e^{b\ln a}$$ where $e$ is the mathematical constant equal to approximately 2.71. Applying to this context, $$n^{1/\ln n}=e^{(ln n)/(\ln n)}=e^1=e$$