Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

How can one prove $e^n$ and $\ln(n)$, modulo 1, are dense in $[0,1]$, for $n=2,3,4...$?

By dense is meant, for any $0<a<b<1$, there is an integer $m$ such that $0<a<f(m) mod 1<b<1$

share|improve this question

2 Answers 2

They are not uniformly distributed, which would mean e.g. $$\lim_{n\to\infty} \frac{|\{k<n\colon f(n)<a\}|}n=a\quad\text{for all }a\in[0,1].$$ For example between $e^M$ and $e^{M+1}$ there are about $e^{M+1}-e^{M+\frac12}$ numbers $n$ with $\ln(n)\bmod 1>\frac 12$ and $e^{M+\frac 12}-e^{M}$ numbers $n$ with $\ln(n)\bmod 1<\frac 12$. These counts differ by a factor of $\sqrt e$ and that will be the relative proportion the larger the range of $n$ one checks becomes.

But they are dense in $[0,1]$ and that is the property you are looking for (as reflected by the edit of the question).

For the logarithm: Let $\epsilon>0$ be given. Find $N$ such that $\frac1N<\epsilon$. Then $0<\ln(n+1)-\ln n<\frac1n<\epsilon$ for all $n>N$ (because the derivative of $\ln$ is the reciprocal). Therefore the numbers $\ln n\bmod1$ with $N<n<e N+1$ hit every subinterval of length $\epsilon$.

For the exponential this is a bit more difficult.

share|improve this answer
    
I know that this is an old answer, but I don't understand the last paragraph. How does it prove that it is dense in $[0,1]$? –  math.n00b Apr 19 at 11:13
    
@math.n00b When computing modulo $1$, we may consier $[0,1]$ wrapped to a circle by identifying $0$ and $1$. On the tour from $N$ to $\approx eN+1$, the logarithm grows by $1$, i.e. we walk around the circle once, and we always walk forward in steps $<\epsilon$. Therefore we cannot "jump" over any interval of length$\epsilon$ without hitting it. - Revisiting this asnwer, however, i have still litttle more to say about the exponential thantahat it is "a bit more difficult", hm. –  Hagen von Eitzen Apr 19 at 12:35

I do not know for $e^n$, but for $\log(n)$ modulo 1, it is not uniformly distributed, according to http://en.wikipedia.org/wiki/Equidistributed_sequence .

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.