minecraft button 1 takes me to menu every time
How do I fix the left mouse opening the menu instead of breaking blocks?
Double limit of $\cos^{2n}(m! \pi x)$ at rationals and irrationals I stumbled upon this "relation" (is the name correct?):  $$ \lim_{m \to \infty} \lim_{n \to \infty} \cos^{2n}(m! \pi x) = \begin{cases} 1,&amp;x\text{ is rational}\\ 0,&amp;x\text{ is irrational}\end{cases} $$  How is it called and why is it so? I'm really not asking for a proof since I fear it would be too complicated for me to understand, but rather for an "intuition". I'm trying to make a command block that spawns an item in front of you if you are holding an item with a specific name. I've got these two working scripts;  /testfor @p[r=10] {Inventory:[{tag:{display:{Name:"Item Name"}}}]}  /testfor @p[r=10] {SelectedItemSlot:0,Inventory:[{Slot:0b,­id:"minecraft:diamond_sword"}]­}   but I can't get them together. The block should only look for an item in the active slot. I have a sequence $T_1,T_2,\ldots$ of independent exponential random variables with paramter $\lambda$. I take the sum $S=\sum_{i=1}^n T_i$ and now I would like to calculate the probability density function.  Well, I know that $P(T_i&gt;t)=e^{-\lambda t}$ and therefore $f_{T_i}(t)=\lambda e^{-\lambda t}$ so I need to find $P(T_1+\cdots+T_n&gt;t)$ and take the derivative. But I cannot expand the probability term, you have any ideas? How can I pad an integer with zeros on the left? How do you left pad an int with zeros when converting to a String in java?  I'm basically looking to pad out integers up to 9999 with leading zeros (e.g. 1 = 0001). Looking for book: contact with aliens, five different races, mismatched claws, biological imperative to breed Is Argothian Elder a Druid? is listed on a lot of websites with the Druid creature type, but the card only lists "Elf".  Is Argothian Elder a Druid too? Network interface name changes after update to 15.10 - udev changes I updated a virtual machine running Ubuntu server 15.04 to the just released new stable 15.10.  There were no apparent problems, but after reboot the machine lost its network connection. lspci showed the correct card and lsmod proved that the driver had been loaded.  Hints about editing or removing /etc/udev/rules.d/70-persistent-net.rules did not succeed (still no network, no new file), the famous /lib/udev/write_net_rules did not even exist.  I don't have much clue regarding udev and systemd, so it took me some time to find in /sys/class/net that the network interface name changed. It became ens32, which was renamed from eth0. After I changed /etc/network/interfaces network communication was enabled again.  But - why does this happen at all? And if it happens, shouldn't the interfaces file be updated automatically?  Now that I deleted the virtual network card and created another one, eth0 becomes eno16777728, which is not so, uhm, nice.  Should this behaviour (at least that of the upgrade procedure) be reported as a bug?  Furthermore, is /etc/udev/rules.d/70-persistent-net.rules obsolete now? And (although only partly related) what about /etc/udev/rules.d/70-persistent-cd.rules?)  Edit - additional question (after accepted answer) The dependency of /etc/network/interfaces from the actual interface name bothered me. I tried a new installation of *ubuntu in another virtual machine. To my surprise, /etc/network/interfaces contained a reference to the loopback device only. However, with my original VM this change prevented the network to come up. So what else do I need to change?  Edit Well, from another test I found that a new Ubuntu Server has the network interface card in /etc/network/interfaces, while XUbuntu has not. Maybe it is using network-manager or something else. Donating winning lottery ticket to 501(c)3 Private Foundation: cost-basis deduction + full tax free redemption for foundation? Legitimate edits of less than 6 characters I recently came across an  by  which contained a link to a specification that has since been moved. When attempting to edit the link, a change which involved the subtraction of only 4 characters, I ran up against the 6 character minimum requirement.  Ordinarily this would not be an issue. A less experienced poster would likely have other things within the answer that could be changed (). In fact, this seems to be the answer on every meta post relating to this topic (, , etc...).  The problem here, since I don't have 2k reputation, is that BalusC writes excellent answers... with the reputation to back them up. I don't feel there is anything in the post (besides the link) that would benefit from me editing.  What is the standard practice here?   Flag the post and explain my situation in the notes (for someone with higher reputation)? Comment on the post and hope that a) visitors read the comments or b) the OP gets notified and updates their post? Make edits, for the sole purpose of increasing characters, providing no benefit and possibly hurting the quality of the post?   For reference, the EL Specification in the post should be changed to , if someone wants to go ahead and take care of this. I just discovered Matlab's factor()-function, and I randomly typed in 20081294819, and to my surprise it only had two factors (5099 and 3938281)! I had expected many more factors for such a big number and wondered how normal this was. The following is what I've done in my investigation so far.  In the first figure below, I have plotted the probability that some number below $10^k$ has $m$ indistinct prime factors.  The second figure shows the evolution of the probability of finding a number with $m$ indistinct prime factors as the numbers one is looking at grows, i.e. it is just another way to visualize the same data. I have left out all points of zero probability.  If one looks at the first part of the figure, it seems that the peak of the curve for some $k$ shifts toward higher $m$ as $k$ grows.   My first question is this: Does this behavior (i.e. the peak shifting toward higher $m$ as $k$ grows) continue indefinitely, or will the peak stabilize at some point? The latter seems unlikely but I can't be sure.  My second question is this: Approximately how fast does the peak-value $m_{peak}$ move as $k$ grows?  I briefly looked at the , but this involves distinct primes and I don't really know much number theory, so any help would be greatly appreciated! Are mirror lenses good for wildlife photography in daylight? I've recently seen these Rokinon/Opteka mirror lens with whooping focal length (like 500mm, 600mm, 800mm, 1000mm) at a cheap price. And I have seen some of their same pictures in Flickr and vendor sites. But the only thing is that they usually starts from smaller aperture (f/5.6 and upwards)   Now what I was wondering, as they are cheap with quite good IQ - are they good for any bird photography or wild life photography in proper daylight? My wife and I are preparing to sell our home and are discovering some weird things. Our home was built in 1958, so it is older. We found this in a corner that had some furniture in front of it.   We are wondering    What kind of wiring is this?  Is it safe to handle or remove? another topology multiple choice Let $S^1 = \{(x, y) \in \Bbb R^2 : x^2 + y^2 = 1 \}.$ Let $D = \{(x, y) \in\Bbb R^2 : x^2 + y^2 \le 1 \}$ and $E = \{(x, y) \in\Bbb R^2 : 2x^2 + 3y^2 \le 1\}$ be also considered as subspaces of $\Bbb R^2.$ Which of the following statements are true?  a. If $f : D \to S^1$ is a continuous mapping, then there exists $x \in S^1$ such that $f(x) = x$.  b. If $f : S^1 \to S^1$ is a continuous mapping, then there exists $x \in S^1$ such that $f(x) = x$.  c. If $f : E \to E$ is a continuous mapping, then there exists $x \in E$ such that $f(x) = x$. Remotely changing hard drive boot order, windows 7 What do the numbers in a man page mean? Is the following proof correct, or are certain steps illegal?  Suppose $f:G_1\to G_2$ is a surjective group isomorphism, $N_1\lhd G_1, N_2\lhd G_2$ normal subgroups, with $N_1=f^{-1}(N_2)$. Prove that $(G_1/N_1)\cong (G_2/N_2)$.  Proof:  As $f$ is surjective, we an use the first isomorphism theorem to get $G_1/\ker(f)\cong G_2$, which implies that $$(G_1/\ker f)/(N_1/\ker f)\cong G_2/(N_1/\ker f)$$  Using the first isomorphism theorem we also know that $$N_1/\ker (f)\cong f(N_1)=f(f^{-1}(N_2))=N_2$$  Combining this we can see that $(G_1/\ker f)/(N_1/\ker f)\cong G_2/(N_1/\ker f)\cong G_2/N_2$.  Using the third isomorphism theorem we have that: $$ (G_1/\ker f)/(N_1/\ker f)\cong G_1/N_1$$  And from the last two lines we have $G_1/N_1\cong G_2/N_2$ $\tag*{$\Box$}$ Proof of the formula $1+x+x^2+x^3+ \cdots +x^n =\frac{x^{n+1}-1}{x-1}$ So I have these two wheels parented to the leg of a robot. I wanna make them spin a few times but they're spinning around the wrong axis. With other objects I could just press R, Y, Y to make them spin right when they're already at an angle, but for some reason it doesn't work with these. Would be amazing if someone helped me fixing this! Javascript: negative lookbehind equivalent? Is there a way to achieve the equivalent of a  in javascript regular expressions?  I need to match a string that does not start with a specific set of characters.  It seems I am unable to find a regex that does this without failing if the matched part is found at the beginning of the string.  Negative lookbehinds seem to be the only answer, but javascript doesn't have one.  EDIT: This is the regex that I would like to work, but it doesn't:  (?&lt;!([abcdefg]))m  So it would match the 'm' in 'jim' or 'm', but not 'jam' Let $g(x)\in \mathbb{Z}[x]$, a nonconstant polynomial. Show that the set of primes $p$ such that $p\mid g(n)$ for some $n\in \mathbb{Z}$ is infinite.  I don't know how to start. I have tried asuming that the set is finite but i haven't reached any contradiction.