Question about Horses
Questions on "All Horse are the Same Color" Proof by Complete Induction
Proving that $d(f,g)=\|f-g\| = \sup \limits_{0\leq x \leq 1} |f(x)-g(x)|$ is a metric on $X=C[0,1]$ Let $X=C[0,1]$ be the set of all continuous functions on $[0,1]$. For any two functions $f,g\in X$, set $$d(f,g)=\|f-g\| = \sup \limits_{0\leq x \leq 1} |f(x)-g(x)|.$$  Prove $(X,d)$ is a metric space.    My attempt:  This question comes down to showing that $d$ is a metric, which means that:   $d(f,g)\geq 0$ $d(f,g)=0\iff f=g$ $d(f,g)=d(g,f)$ Triangular sadness.     1) Nonnegativity is guaranteed by taking the supremum of the absolute value of a sum, since the absolute value of a sum is non-negative, the supremum of non-negative numbers is non-negative.  $\square$    2) For the supremum of $|f(x)-g(x)|$ to be equal to $0$, the greatest number for $|f(x)-g(x)|$ from $0\leq x\leq 1$ must be $0$, hence $|f(x)-g(x)|=0$ for all values on this range, and thus $f(x)=g(x)$ is the constant zero map.  $\square$    3) $|f(x)-g(x)|=|g(x)-f(x)|$ implies that $\sup \limits_{0\leq x \leq 1} |f(x)-g(x)|=\sup \limits_{0\leq x \leq 1} |g(x)-f(x)|$ $\square$    4) Triangular sadness:  We need to prove that $d(f,g)\leq d(f,h) + d(g,h)$  I.e.  $\sup \limits_{0\leq x \leq 1} |f(x)-g(x)|\leq \sup \limits_{0\leq x \leq 1} |f(x)-h(x)|+\sup \limits_{0\leq x \leq 1} |g(x)-h(x)|$  Now I am not sure how I can 'behave' with the sup 'function'. Can I do the following?  $$\sup|f(x)-g(x)| = \sup|f(x)-g(x)+h(x)-h(x)|=\sup|f(x)-h(x)+(h(x)-g(x))|$$ Then use normal triangular inequality:  $$\sup|f(x)-h(x)+(h(x)-g(x))|\leq \sup(|f(x)-h(x)|+|h(x)-g(x)|)=\sup(|f(x)-h(x)|+|g(x)-h(x)|)$$   This is obviously less than $\sup \limits_{0\leq x \leq 1} |f(x)-h(x)|+\sup \limits_{0\leq x \leq 1} |g(x)-h(x)|$, but I don't know how to prove it. How do I finish that one off. I hope to receive my PhD in Mathematics in May of 2015, so I am currently applying for jobs.  Due to life circumstances, I'm fairly certain that I will only be staying at my next position for about 2 years.  Does this mean I shouldn't even try to apply for tenure-track positions?  Will a hiring committee not even consider me for the position if I'm not willing to commit to staying with them for a certain amount of time?  I would love to get a teaching/lecturing position at any institute of higher education (4-year research university, liberal arts school, community college), but as I look for openings, a lot of them are tenure-track assistant professor positions.  Should I go through the effort of sending in an application, or will that be a waste of my, and the committee's, time?  Thanks for any advice you have!  Edit (to address Nate's comment):  My wife is currently applying for 2 year graduate degree programs in various cities in the US, so I'm applying for jobs in the same cities.  When she finishes her program, we plan to move outside of the US (Africa or Southeast Asia), where I do hope to remain in academia, teaching mathematics to college-aged students. What is the difference between range and xrange functions in Python 2.X? Let $x&gt;0$, $y&gt;0$ and $z&gt;0$. Show that   $$x^3y+y^3z+z^3x\ge xyz(x+y+z).$$   I known we can't WLOG: $x\ge y\ge z$, if this, I can use rearrangement inequality, But other I can't it. Thanks? $ ls -l /tmp/test/my\ dir/ total 0   I was wondering why the following ways to run the above command fail or succeed?  $ abc='ls -l "/tmp/test/my dir"'  $ $abc ls: cannot access '"/tmp/test/my': No such file or directory ls: cannot access 'dir"': No such file or directory  $ "$abc" bash: ls -l "/tmp/test/my dir": No such file or directory  $ bash -c $abc 'my dir'  $ bash -c "$abc" total 0  $ eval $abc total 0  $ eval "$abc" total 0 What solutions does the equation 4x≡2mod10 have? (Hint, it will have more that one.) What about solutions to an equation ax≡dmodn, where d=gcd(a,n)? What solutions does the equation $4x\equiv2\mod10$ have? (Hint, it will have more that one.) What about solutions to an equation $ax\equiv d\mod n$, where $d=\gcd(a,n)$?  This is the question that appeared in our universities last year paper. But it seems very difficult for me like for first part I am able to solve by simplifications I got $x=5\cdot Z +3$ as solution which makes sense and seems fair but for the second one, I have no idea how can I approach that. Can you please help me out with that one. I tried to simplify that by using Euclidean algorithm but still, I didn't get any idea that what actually the solution will be. My final exam is on 2nd of next month and because of covid I am unable to contact in person for any help. So any help from this site will be appreciated. Thank you for looking at this question! Get last insert id after a prepared insert with PDO Create Yosemite install disk on a Windows machine I have a 2009 Mac with a new blank SSD. I have a Snow Leopard install disk but it doesn't work (it was a replacement installer disk and has never worked), so I don't have a working OS X install.  I do have a Windows 7 machine.  How should I go about installing Yosemite? All instructions I can find require OS X at some point in the process. I can't even download it from the store unless I'm on a mac. I am getting this message every time I do something like starting or stopping a service.  perl: warning: Setting locale failed.    perl: warning: Please check that your locale settings:            LANGUAGE = "en_US:en",            LC_ALL = (unset),            LC_MESSAGES = "en_US.UTF-8",            LANG = "en_US.UTF-8"        are supported and installed on your system.    perl: warning: Falling back to the standard locale ("C").    locale: Cannot set LC_CTYPE to default locale: No such file or directory    locale: Cannot set LC_MESSAGES to default locale: No such file or directory    locale: Cannot set LC_ALL to default locale: No such file or directory    (Reading database ... 21173 files and directories currently installed.)   Removing bind9 ...    * Stopping domain name service... bind9                                        [ OK ] Processing triggers for man-db ...    locale: Cannot set LC_CTYPE to default locale: No such file or directory    locale: Cannot set LC_MESSAGES to default locale: No such file or directory    locale: Cannot set LC_ALL to default locale: No such file or directory      How do I fix this error ? When is $2^n \pm 1$ a perfect power Is there an easy way of showing that $2^n \pm 1$ is never a perfect power, except for $2^3 + 1 = 3^2 $?  I know that   gives the result directly, but I'm hopefully for a more elementary method.    I can show that it is never a square, except for $2^3 + 1$.  Proof: Cases $n=1, 2, 3$ are easily dealt with. Henceforth, let $n\geq4$.  $2^n -1 \equiv 3 \pmod{4}$ hence is never a square.     If $2^n +1 =x^2$, then $2^n = (x-1)(x+1)$ and both of these are powers of 2. Thus we must have $(x-1) = 2, (x+1) = 4$. This gives the solution of $2^3 + 1 = 3^2$.    Let's now do an odd prime.  Say $2^n +1 = x^p$. Then $2^n = x^p - 1 = (x-1)(x^{p-1}+x^{p-2} + \ldots +1)$, so both terms are powers of 2. We have $ x = 2^m+1$ is odd. But the other term is the sum of $p$ odd numbers, hence is odd. Since this is clearly greater than 1, we get a contradiction.  Say $2^n -1 = x^p$. Then $2^n = x^p + 1 = (x+1)(x^{p-1} - x^{p-2} + \ldots -x +1 )$, so both terms are powers of 2. We have $x = 2^m -1$ is odd. But the other term is the sum of $p$ odd numbers, hence is odd. Since $x^p + 1 \neq x+1$ except for $p=1$, this means that the term is greater than 1. Hence we get a contradiction. I'm trying to downgrade my iPhone from the current iOS to an older one, as per .  But every time I try, I always receive this error:     The iPhone could not be restored. This device isn't eligible for the requested build.     I have tried many times with and without DFU mode. Any ideas regarding this? Valid US visa on expired passport. Can I travel to the US? Javascript function only works if there's an alert While reviewing "First Posts" on Stack Overflow, I often come across new users posting comments as answers. It seems (at least to me) they are not doing this because they are unaware of how Stack Overflow works but because they can't comment on any question they are forced to put it as answer.  I have found duplicate questions for my request like:   ,  and    but the best explanation I have found is an  to .     I think the main reason this isn't supported is there's no way to   downvote comments, which would make them attractive to spammers. If   somebody comments on the top answer in a question the only way to get   rid of it is for six people to flag it. Comment flags don't show up on   10k tools, so it needs to be six people that happen to stumble across   the spam comment, or a moderator that checks the list manually. People   can comment every 15 seconds, so that can get out of hand pretty   quickly. Comments also aren't listed on the user's profile page, so   it's hard to see at a glance if a user has been spamming   So I am suggesting allowing new users (with less than 50 reputation points) to comment only 5 times every day or only 25 times times until they reach 50 reputation points or any other variation of it. Can this identity be derived from the binomial theorem?  $$n(n+1)2^{n-2} = \sum_{i=1}^{n}  i^2 \binom{n}{i}$$    I tried starting from $2^n = \displaystyle\sum_{i=0}^{n} \binom{n}{i}$ and dividing it by $4$ in order to get $2^{n-2}$. Leave out a term when summing How would I convert a char array to int? Could a ship warp into Borg cube and destroy it? During the Wolf-359 incident, 39 starships were destroyed, and 11,000 people were killed or assimilated.  Why didn’t one of the smaller ships warp into that one Borg cube? Doesn’t warping into it destroy anything?  Even if it just warps through without touching, one could program the navicom to self destruct while the ship is in the middle of Borg cube. I am making an Android game that is only in portrait screen orientation.  It works great when I run it on my phone, but when I run it on a tablet, even though the screen size is bigger, all of the bitmaps are the same size. Is there any way to make the bitmaps stay the same proportion even on different size screens? I read (or do I say "have read"?) many rules for when to use the present perfect. I found them complex and hard to understand (or do I say "have found"?). I am finding it hard to apply these rules in real sentences.  Is there a simple and clear way to explain the difference between past simple and present perfect? If there is a simple explanation, please tell it! If there is no simple explanation, please tell why it is so complicated. Maybe if I knew why there is no simple explanation, that would help me understand what work I need to do in order to learn the difference.