I have been trying to breed pigs, sheep, cows, and chickens, but I can only feed the cows, meaning I can only breed them and not the other animals. This is very annoying and I was wondering if anyone knew why this is happening
In Minecraft, I know you can breed animals. In fact, in recent updates it's required for the player who just can't start their mornings without bacon and eggs!  I've tried pulling two pigs together in a single pen, but all they do is snort at me. And the chickens? Well, there's plenty of eggs, but no hatching.  How do I get them to make more bacon and eggs?
How to run a server on port 80 as a normal user on Linux? I have Googled about a solution for quite some time, but couldn't find an answer.   I am on Ubuntu Linux and want to run a server on port 80, but due to security mechanism of Ubuntu, I get the following error:      java.net.BindException: Permission denied:80   I think it should be simple enough to either disable this security mechanism so that port 80 is available to all users or to assign required privileges to the current user to access port 80. Since Chrome version 38, there's a pretty ugly button in the title bar of the Chrome window that allows you to switch profiles quickly.  Since I'm the only one that uses my computer, this is not really useful to me, and I'd rather reclaim the space for more open tabs.  I've looked in the settings but don't see a way to disable it.  How can I get rid of the button? Adding my launcher to the Unity Launcher automatically. How? Under , is $\exists x(x=a)$ true in every interpretation in first order logic (FOL) with equality? If so, could $\exists x(x=a)$ be considered a tautology? This question was motivated by  which was closed for lacking clarity. Here I have attempted to add that clarity myself so that the same question can be useful to others who are wondering a similar thing. This is a self answer question. Why is the Apps flash storage so high and how can it be reduced? This is the disk storage info:    This is the Applications folder info:    Why is the storage usage so high and how can it be reduced? This is on a MacBook Pro Retina 13" with OSX 10.9.5.  Edit: I had tried all the suggestions made by @user3439894 in his answer but didn't mention it before posting. What is the limit of $n \sin (2 \pi \cdot e \cdot n!)$ as $n$ goes to infinity? I tried and got this   $$e=\sum_{k=0}^\infty\frac{1}{k!}=\lim_{n\to\infty}\sum_{k=0}^n\frac{1}{k!}$$ $$n!\sum_{k=0}^n\frac{1}{k!}=\frac{n!}{0!}+\frac{n!}{1!}+\cdots+\frac{n!}{n!}=m$$ where $m$ is an integer. $$\lim_{n\to\infty}n\sin(2\pi en!)=\lim_{n\to\infty}n\sin\left(2\pi n!\sum_{k=0}^n\frac{1}{k!}\right)=\lim_{n\to\infty}n\sin(2\pi m)=\lim_{n\to\infty}n\cdot0=0$$  Is it correct? Which SUSY models are affected by the recent LHCb result? If I upload my brain into a computer is it still me? I think the answer is yes but I know a lot of people disagree. So, I would like to ask these people when exactly does it stop being me.  Let's say I want to upload my brain into a computer using the following procedure:  I have each of my neurons replaced by electronic neurons. By electronic neurons I mean chips with the necessary hardware and software to perform the exact same function that the neuron being replaced was performing. This means that given the same inputs that the biological neuron was given it would produce the same outputs. Then I connect that electronic neuron to all the neurons that former biological neuron was connected to.   At the end of this process is it still me? If not when did it stop being me? When one neuron was replaced? When 1,000 were replaced? When 1,000,000 were replaced?  (assuming it is still me)  Then, I divide these electronic neurons into groups and for each group I perform the following:   Write software to simulate the group of electrical neurons in my computer such that given the same inputs that go into the group of electronic neurons in my brain, it will produce the same outputs. Replace each group of neurons with another chip that communicates with my computer. Each of the chips will communicate to the corresponding software module in order to determine how to transform its inputs into the necessary outputs. Connect all of the inputs and outputs of the group of electronic neurons to that new chip.   At the end of this process is it still me? If not when did it stop being me? When one group was replaced? When 1,000 were replaced? When 1,000,000 were replaced?  (assuming it is still me) Now, what I have is a bunch of these new chips in my head, connected to each other and for each of these chips I have a small neural network software module in my computer. So, now for each pair of chip/software module I do this:   Transfer all connections going into and out of the chip into the computer version (i.e. connect the software module to the other software modules that represent the other chips that this chip is connected to) Disconnect the chip from the other chips and remove it   At the end of this process is it still me? If not when did it stop being me? When one of the new chips was replaced? When 1,000 were replaced? When 1,000,000 were replaced?  If it is still me then I have successfully moved my brain into a computer without ceasing being myself.  So, again the question is if at the end it is not me anymore when exactly does it stop being me and why does it stop being me?  EDIT: This question assumes that our universe and everything in it (including ourselves) follows the (testable) laws of physics. As it stands it also assumes that neuroscience is mostly right, although the question could also be considered without that requirement if instead of neural simulations we were to implement physics simulation of the brain. Of course this is a lot less practical. However, if your view is that our minds have a supernatural component then the question does not make any sense.  It was also pointed out that this is related to the Ship of Theseus, i.e. is something still the same if all its parts have been changed. With regards to that I think it is useful to consider that most of the cells in our body (not including brain cells) are regularly replaced anyway and some people even get entire organs replaced. Yet, we don't say that they stopped being themselves. Note, however, that if you are assuming a supernatural component of the mind that this explanation is not really adequate or relevant. The number of permutations of $\{1,2,\ldots,n\}$ that have exactly one ascent (rise). Sloane's  counts the number of $n$-permutations with exactly one ascent.  For example $a(3)=4$ because we have: $1\wedge32$, $21\wedge3$, $2\wedge31$, $31\wedge2$ where I have marked the unique ascent with $\wedge$.  The same sequence also counts the number of length $n$ binary words that contain at least two $1$'s. For example $a(3)=4$ because we have: $011, 101, 110, 111.$  Is there a simple bijection between these two classes?  The formula for the sequence is $a(n) = 2^n - n - 1$.  I see how this counts the number of such binary words.  Is there a combinatorial derivation of this formula demonstrating that it counts the number of such n-permutations?  Both the exponential and ordinary generating functions of the sequence are given.  Again, I understand their symbolic derivation for enumeration of such binary words but can these functions be derived symbolically by considering the structure of such n-permutations? Why Java needs Serializable interface? We work heavily with serialization and having to specify Serializable tag on every object we use is kind of a burden. Especially when it's a 3rd-party class that we can't really change.  The question is: since Serializable is an empty interface and Java provides robust serialization once you add  implements Serializable - why didn't they make everything serializable and that's it?    What am I missing? Zsh says "no matches found" when trying to download video with youtube-dl I downloaded youtube-dl using pip on CrunchBang (a Debian Wheezy distro). When I run   youtube-dl {video URL}   I get  zsh: no matches found: {video URL}   I guess it has something to do with zsh, because I found some users on Arch forums complaining about it. When I switched to bash it worked. I would like to use the same pipe for different applications, like in:  cat my_file | {   cmd1   cmd2   cmd3 }   Cmd1 should consume part of the input. Cmd2 should consume another part and so on.  However, each cmd eats more of the input then it read really needs due buffering.  For example:  yes | nl | {    head -n 10 &gt; /dev/null   cat  } | head -n 10   Outputs from line 912 instead of line 11.  Tee is not a good option, because each command is supposed to consume part of the stdin.   Is there a simple way to get this working? I am trying to encrypt an entire USB drive with Truecrypt 7.1a. But as long as there is a partition it will only encrypt that. This will make it appear like the USB is full instead of completely empty, which isnt what Im aiming for.   I've tried with DISKPART, USB Partition Tool, and the built-in storage manager. When I delete all partitions, Windows still assigns the drive a letter and assumes that it has a partition covering the whole space.  I know that it is possible as I have done it with another USB, but I just don't remember how I did it.  Ideas? What is the difference between encrypting something and hashing something?  in what situations would I want one or the other? Questions on "All Horse are the Same Color" Proof by Complete Induction In the new header could we please move the chat link back to where it was? (One click away)  As a daily frequent to the JavaScript room that's the one link I'd love to have visible 100% of the time.  Aside from that, I actually love the new header. (Maybe take it a step further an add a customizable header with (X) link spots for your most used links?)  Just my thoughts Finding the limit $\lim_{x\rightarrow \infty} \sqrt[3]{x+1}-\sqrt[3]{x}$ Prove that if $n$ is a natural number and $(3n+1)$ &amp; $(4n+1)$ are both perfect squares, then $56$ will divide $n$.   Clearly we have to show that $7$ and $8$ both will divide $n$.  I considered first $3n+1=a^2$ and $4n+1=b^2$. $4n+1$ is a odd perfect square.  - so we have $4n+1\equiv 1\pmod{8}$; from this $2|n$ so $3n+1$ is a odd perfect square.  - so $3n+1\equiv 1\pmod{8}$ so $8|n$ but I can't show $7|n$. How do I show this?  Thanks for the help. Website display problem - across all browsers whenever I go to  or  the page loads like this:    How can I fix this? Intuition on the Kullback–Leibler (KL) Divergence