Suppose $f\in C([a, b]→[a, b]),\:|f(x)−f(y)|≤\frac{1}{2}|x−y|$ for all $x,y∈[a, b]$. Show that there exists $ξ∈[a,b]$ such that $f(ξ)=ξ$
Contraction mapping in the context of $f(x_n)=x_{n+1}$.
Code Formating in Comments Creating a new DOM element from an HTML string using built-in DOM methods or Prototype Does C1 code coverage analysis exist for Ruby? I'm currently using  to get C0 code coverage analysis for a rails project that I'm working on.  However, those results are practically meaningless- I have 100% coverage according to rcov (as it only covers C0 analysis) and I've barely written half the test cases for the functionality that exists thus far.  I'm used to the useful results from the code coverage in Visual Studio 2008 Team, which has C1 coverage.  Are there any tools that provide similar coverage for ruby? I have this strange problem with conky. It doesn't show properly on the desktop:    I've tried everything from editing conky widget file to reinstalling conky and conky manager (v.2.4). Who knows how to fix it? Creating random numbers with no duplicates Let me filter jobs by the employer's Joel Test Scores I was wondering how to make a clickable terminal shortcut for my desktop using the command easytether connect.  I don't want to have to open/close the terminal every time I wish to connect to the Internet through my phone.  I've tried updating my gnome-panel but I can only make a new directory on my desktop. $f(f(x)f(y))+f(x+y)=f(xy)$ Find all functions $f\colon \mathbb R\rightarrow \mathbb R$ such that for all reals $x$ and $y$:   $$f(f(x)f(y))+f(x+y)=f(xy).$$   It was six hours ago in IMO 2017 (problem 2).  I tried  the standard way: $x=0$, $x=y$, $x=1$,etc. but without any success.   Let $f(0)=a$. Hence, for all $x\in\mathbb R$ we have $f(a(f(x))+f(x)=a$. What is the rest?   Also we have $(x-1)(y-1)-1+x+y-1=xy-1$ and  $1-(1-x)(1-y)+1-x-y=1-xy$. Why aren't there any common words for 'defecating' and 'urinating'? I'm new to inequalities in mathematical induction and don't know how to proceed further. So far I was able to do this:  $V(1): 1≤1 \text{  true}$  $V(n): n!≤((n+1)/2)^n$  $V(n+1): (n+1)!≤((n+2)/2)^{(n+1)}$  and I've got : $(((n+1)/2)^n)\cdot(n+1)≤((n+2)/2)^{(n+1)}$ $((n+1)^n)n(n+1)≤((n+2)^n)((n/2)+1)$ Im trying to understand the solution about this, and all the other solutions are.. a bit weird for me and dont answer all my questions!  Reference :   Im using the answer there as reference, but my understanding is a bit different!     Find the error in the following proof that all horses are the same   color. CLAIM: In any set of h horses, all horses are the same color.      PROOF: By induction on h.      Basis: For h = 1. In any set containing just one horse, all horses   clearly are the same color. Induction step: For k > I assume that the   claim is true for h = k and prove that it is true for h = k + 1. Take   any set H of k + 1 horses. We show that all the horses in this set are   the same color. Remove one horse from this set to obtain the set H1   with just k horses. By the induction hypothesis, all the horses in H,   are the same color. Now replace the removed horse and remove a   different one to obtain the set H2 . By the same argument, all the   horses in H2 are the same color. Therefore all the horses in H must be   the same color, and the proof is complete.   Here's what i have come up with :  Suppose a set of 1 horse. $H_a = { horse_{1} }$  Obviously, all the horses in set $H_a$ are the same, since theres just 1 horse.  So using that as the Basis of the induction we can proceed and try to prove its true for $N$ horses.  -- I dont fully understand the part below   As an example : set $H_0$ :   $H_0 = { horse_{1}, horse_{2}, horse_{3}... horse_{n} }$  In my understanding, its because, I can make a subset  formed by 1 horse :  $K_1  = {horse_{1}}$ $K_2  = {horse_{2}}$ ...  I don't get it. I clearly know that this proof is a lie.  And for me, its because you cant claim theres a relation on a set with size $&gt;= 2$ , since :  $H_1 = { horse_{1}, horse_{2}}$  Theres nothing that says $horse_{1}$ equals $horse_{2}$. The basis was for one horse. But that alone is not a proof.  So what should I do ? Catenatives followed by infinitives and gerunds LINQ's Distinct() on a particular property I am playing with LINQ to learn about it, but I can't figure out how to use Distinct when I do not have a simple list (a simple list of integers is pretty easy to do, this is not the question). What I if want to use  on a list of an Object on one or more properties of the object?  Example: If an object is Person, with Property Id. How can I get all Person and use Distinct on them with the property Id of the object?  Person1: Id=1, Name="Test1" Person2: Id=1, Name="Test1" Person3: Id=2, Name="Test2"   How can I get just Person1 and Person3? Is that possible?  If it's not possible with LINQ, what would be the best way to have a list of Person depending on some of its properties in .NET 3.5? Smileys in LaTeX I would like to include smileys in my LaTeX document. Is there any package with lots of different smileys?  In mnsymbol and wasysym, I found some general symbols:  \documentclass{article} \usepackage{MnSymbol,wasysym} \begin{document} wasysym: \smiley{} \frownie{} \blacksmiley{}  MnSymbol: \(\smile{} \frown{}\) \end{document}     But I do not like the output. Actually, I am looking for smileys which look like "default smiles" in Google Talk, MSN, ... ;) &lt;- this one is my favourite. ;) How to setup a restricted SFTP server on Ubuntu? How can I run scripts automatically when Ubuntu starts up so I don't have to run them manually after startup? I know that $re^{i\theta} = x + iy$ for any complex number $x + iy$ by Euler's formula. How do you calculate relative and global phase? Is it possible to trade Pokemon from the 1st generation games to the most recent ones? In The Force Awakens, Finn and Poe steal and escape in a TIE wearing no personal life support apparatus. TIEs have been upgraded with shields, hyperdrives (for "/sf"), weapons etc, but as far as I know they weren't upgraded with built in life support.   Finn and Poe should have frozen and/or suffocated after hitting space in the TIE. In the Rebels series, Sabine did the same thing. I've looked at what Wookieepedia states about the TIE as well as the old video game Star Wars "TIE Fighter".  Does the movie or any other work explain how Poe and Finn survived? Integral $\int_{\frac{1}{2}}^1 \frac{\ln x}{\sqrt{x^2+1}}dx$