I am trying to prove that $\frac{1}{k+1} \le\ln(1+\frac{1}{k}) \le \frac{1}{k}$. This showed up as a known fact in a proof for $(1+\frac{1}{k})^k = e$ as $k$ goes to infinity, so I would like to prove it without using that fact.  I tried to prove the first part of the inequality by using another known inequality (one which I am comfortable proving):  $1+\frac{1}{2}+\frac{1}{3}+...+\frac{1}{k} &gt;\ln(1+k)$  Let $a$ denote $1+\frac{1}{2}+\frac{1}{3}+...+\frac{1}{k-2}$  $a+\frac{1}{k-1}+\frac{1}{k} &gt;\ln(1+k)$  Scaling this down 1 term:  $a + \frac{1}{k-1} &gt;\ln(k)$  Subtracting the second inequality from the first, we get:  $\frac{1}{k} &gt;\ln(1+\frac{1}{k})$  However, this seems to contradict the statement I'm trying to prove. Could anyone help?
I'm learning calculus, specifically derivatives and applications of MVT, and need help with the following exercice:      Show that, for all $n &gt; 1$ $$\frac{1}{n + 1} &lt; \log(1 + \frac1n) &lt; \frac1n.$$    I tried to follow the below steps in order to prove the RHS inequality:   Proving that $f &lt; g$ on $I$ from $a$ to $b$:  Step $1$. Prove that $f' &lt; g'$ on $\operatorname{Int}(I)$.  Step $2$. Show that $f(a) \leq g(a)$ or that $f(a^+) \leq g(a^+)$  Following the above steps, let $f(x) = \log(1 + \frac1x)$ and $g(x) = \frac1x$, for all $x &gt; 1$. One has  $$f'(x) =  -\frac{1}{x^2 + x} \quad \text{and} \quad g'(x) = -\frac{1}{x^2}.$$  We note that, for every $x &gt; 1$, $f'(x) &gt; g'(x)$. Moreover, $f(1^+) = \log(2) &lt; 1 = g(1^+).$   My problem is that I got the wrong inequality sign in Step $1$.    Looking at the solution in my textbook, the author suggests using the MVT but I don't know how to apply it in this case.
I have this function $$f(x) = x\cos(1/x)$$ defined for all $x \geq 1$.      How do I prove that    $$f(x+2)-f(x)&gt;2$$    for all $x\geq 1$?   I found $$f'(x)= \cos(1/x) + \frac{\sin(1/x)}{x}$$ and $$f''(x)=-\frac{\cos(1/x)}{x^3}.$$ How do i use this information? ICANN charges 18¢ per domain name registered regardless of its extension, but I pay $10 for a domain name per year with my registrar.   What do domain name registrars do for its customers to justify this extra $9.82?  Is there something that they do for our domain names other than registering it with ICANN?   I just read about the 7 people who hold the ICANN database key and got a little bit curious to know what the domain name servers do for us to justify this extra amount (12 times the actual fee)? Proof of $\frac{(n-1)S^2}{\sigma^2} \sim \chi^2_{n-1}$ It's a standard result that given $X_1,\cdots ,X_n $ random sample from $N(\mu,\sigma^2)$, the random variable $$\frac{(n-1)S^2}{\sigma^2}$$ has a chi-square distribution with $(n-1)$ degrees of freedom, where $$S^2=\frac{1}{n-1}\sum^{n}_{i=1}(X_i-\bar{X})^2.$$ I would like help in proving the above result. Thanks. Suppose $f:(a,b) \to \mathbb{R} $ satisfy $|f(x) - f(y) | \le M |x-y|^\alpha$ for some  $\alpha &gt;1$ and all $x,y \in (a,b) $. Prove that $f$ is constant on $(a,b)$.   I'm not sure which theorem should I look to prove this question. Can you guys give me a bit of hint? First of all how to prove some function $f(x)$ is constant on $(a,b)$? Just show $f'(x) = 0$? This is a repost with additional info of an older question that was never answered. I have stumbled upon this old question while also trying to find the name of the book series myself, as I dearly wish to read it again but for the life of me, I can't remember the name of it.      This is a long shot but I'm really in need of help for this because      it was an amazing book. It was either a kid's or YA book. A guess      from what year it was published would be 90s-mid 2000s, as I read it      around 2008-2011.         The book cover was in first person view, with the main character   holding a weapon, and was a 3D rendered image inside a dungeon or   cave (that was very reminiscent of early 90s CGI animation), though   there may be variants.    It would have been set around when computer   games were mainstream (maybe around the same time as when it might've   been published) It's about a teenage boy who is bored at home, so he   looks through an old family computer to play a game and finds one   that he has never seen before. When he plays it he gets transported   into the game which is a fantasy-medieval setting.    All that I can   remember about the game and story is that the main character is on a   quest, he rides horses a lot, (to the point where he can ride horses   perfectly in real life), at one point he eats food at an ingame   tavern/restaurant? and he tosses the ingame coin currency at the   server because he's in a hurry, (don't know why I remember that bit   specifically haha), and he meets a gnome/dwarf character who is   helping him on his journey, who has a home in an ingame mountain, and   that time goes faster in the game. (For example, if he spent 5   minutes in the real world, 3 in-game days would have passed)   Sometimes as he's playing something stops him from being able the   play the game for a few weeks, maybe a concerned parent because he's   playing too much or there's a family vacation. I remember during the   time when he's not playing the game he's on a farm and knew how to   ride the horses there.    There was a character in the real world who   was the main character's sibling, relative or friend. They were like   a rival and was also very whiny (to some extent). They were on the   farm as well with him and questioned how the main character knew how   to ride a horse when he had never done it in real life.   This is all I can remember but if you need more specific information I can try and answer. It is definitely not Space Demons or Demons Don't Dream. If anyone knows anything remotely similar please mention it, I would really appreciate it. Thank you!!            Additional info:    It is not an online game or virtual reality game. It was a normal PC game, and all other characters are (I think), just NPCs.  He woke up for the first time in a field/farm and was super confused about what happened and where he was, as he had never played the game before. He is asked a super serious question before starting the game up for the first time, like "are you sure you wish to play ___?", and then he is transported into the game.  He frequently exited the game, to continue his IRL life. And sometimes, he would lose access to the family desktop PC for a couple of days at a time, and when he went back everyone in the game (NPCs), thought he had disappeared because he was gone for ages. I think once, his family when on holidays and he couldn't take the PC, for example.  It was a book series, not a single book. In later books he would play the game again months later in the real world, and years and years would have passed in the game world.  The plot involved 2 main warring sides/factions/countries of humans, but there were fantasy/magical races and characters involved. I vaguely remember something about each side having official colours, one red and one blue. I think the main character was on the blue side.   The original question was never correctly answered, so I'm posting again to see if anyone can remember.   Books that were ruled out in original post: Eden's Gate &amp; Heir Apparent. Accepting an answer should automatically upvote it as well GUID COMB strategy in EF What licence is subscriber content provided under 4.0, 3.0 or them all? In the footer it says:     site design / logo © 2018 Stack Exchange Inc; user contributions licensed under  with . rev 2018.8.7.31273   However, in the footer under Company > Legal > '6. Content Permissions, Restrictions, and Creative Commons Licensing' it instead doesn't specify which CC BY-SA licence we're releasing our content under. It also links to the CC BY-SA 4.0 license:     The CC-BY-SA Creative Commons license terms are explained in further detail by , but you should be aware that all Public Content you contribute is available for public copy and redistribution, and all such Public Content must have appropriate attribution.   Since  if subscriber content is only provided under 4.0, where the footer says 3.0 it can cause users to break the licences.  The footer under Area 51 also mentions that content is licensed under CC BY-SA 2.5.  Since it's not defined which version of the license the content is provided under, I also interpret it to potentially mean all the versions.    What license is subscriber content licensed under? Book: Handful of children kept in a school as political mythological prisoners Is $\lim\limits_{n\rightarrow\infty} n$ comparable to $\aleph_0$? For example, can we say: $\infty=\lim\limits_{n\rightarrow\infty} n &lt; \aleph_0$?  These are two different types of structures. The limit being like the length, extension, or just generic magnitude and the other being cardinality of a set. Can we compare magnitude to cardinality?  Intuitively, we can reach $\aleph_0$ by counting the natural numbers on the number line and in the process will be approaching $\infty$. Which leads me to believe $\infty\leq\aleph_0$. But I can't see why it should be a strict inequality. I feel like they should be of equal magnitude.  I saw on a recent comment that $2^\infty=\infty$, but are those infinities really the same? It seems not to me. Of course we (usually) have that  $2^{\aleph_0}=\aleph_1$ where ${\aleph_0}$ and $\aleph_1$ are clearly two very distinct infinities, countable vs uncountable at least. Maybe one might argue that as far as the concept of magnitude is concerned, all infinities are "equal". Can Ubuntu use all my 4GB of RAM? How to remove indentation in footnote? I am interested in good integer approximation from below and from above for binary Log(N!).  and  provides only a general idea but not exact values. In other words I need integers A and B so that  A &lt;= Log(N!) &lt;= B Prove the Radical of an Ideal is an Ideal I am given that $R$ is a commutative ring, $A$ is an ideal of $R$, and $N(A)=\{x\in R\,|\,x^n\in A$ for some $n\}$.  I am studying with a group for our comprehensive exam and this problem has us stuck for two reasons.  FIRST - We decided to assume $n\in\mathbb{Z}^+$ even though this restriction was not given. We decided $n\ne 0$ because then $x^0=1$ and we are not guaranteed unity. We also decided $n\notin\mathbb{Z}^-$ because $x^{-1}$ has no meaning if there are no multiplicative inverses. Is this a valid argument?  SECOND - We want to assume $x,\,y\in N(A)$ which means $x^m,\,y^n\in A$ and use the binomial theorem to expand $(x-y)^n$ which we have already proved is valid in a commutative ring and show that each term is in A so $x-y$ is in $N(A)$. The biggest problem is how to approach the $-y$ if we are not guaranteed unity. Does anyone have any suggestions?  Thank you in advance for any insight. If a function $f$ is continuous $\implies$ $|f|$ is continuous.(Answered by Myself) $(i)$ Given a function $f:E \rightarrow \mathbb{R}$ define $|f|:E \rightarrow \mathbb{R}$ by $|f|(x)=|f(x)|$ for $x \in E$ show if $f$ is continuous at $c \in E$ then so is $|f|$.        $(ii)$ Now the converse is not true, find $f$ such that $|f|$ is continuous but $f$ is not. Install python packages for specific python version I understand that in Ubuntu 14.04, you have access to both python 2.7.6 and python 3.4.0. When getting python packages through the command line, how do I make sure that I am installing packages meant for python 2.7.6 and not for python 3.4.0? Problem is to find sum  $$\frac{1}{3!}+\frac{4}{4!}+\frac{9}{5!}\cdots$$  What I knew doesn't apply on this problem  Some series are telescoping, some types are solvable using binomial , both look useless here Binomial gives  $$n (n-1) (n-2)x^3=1$$  $$n (n-1)( n-2)(n-3)x^4=4$$  What approach to use here? Allow HTML in excerpt Here is my excerpt code.  // Generate custom excerpt length function wpbx_excerpt_length($length) {     return 300; } add_filter('excerpt_length', 'wpbx_excerpt_length');   How do I allow html like &lt;a&gt; &lt;b&gt; &lt;i&gt; &lt;br&gt; Cycles in SHA-256 Let's say I start with a particular 256 bit value. Call this $v$. I then hash that value, and get another 256 bit value. Call this $\text{SHA256}(v)$. I take this value and get another 256 bit value. Call this $\text{SHA256}^2(v)$. More generally, let's call the result of hashing $v$ repeatedly $n$ times $\text{SHA256}^n(v)$.  Now my question is, how big will $n$ be, such that $\text{SHA256}^n(v) = v$?  It would seem to me, that if it's a giant sort of permutation, $n$ would have to be $2^{256}$, is that correct? Is that provable, or is there any information on this? (Just curiosity, really.)  Another question I had was, do all 256 bit strings have unique SHA256 values, and is there a way to show that? (Or, stated differently, can it be shown that there are no SHA-256 collisions in the language of all "256 bit strings"?) Why were there so many spells cast in the movies without saying the words to the spell? From my memory of the last Harry Potter movie I saw, I've seen many wizards cast spells without saying the spell at all.  During the final battle in Hogwarts, many wizards just swung their wands and their enemies were knocked out. I am 100% sure about this!  The most remarkable spells were the ones that emit a green or red beam in the final battle of Harry Potter against Voldemort when they pushed their beams towards each other.  So, the question is, are they cheating? Because, unless there are wordless spells, they must say the words for a spell.