Why is the hat feature missing sometimes? Actually, It disappeared right now. Could someone tell me what's going on here? Maybe a bug?
The  page indicates "the hats get put back in their boxes on January 4th". Aside from the pure terror that sentence seems to invoke, I was curious of exactly when this is going to be.  I know that the hats have caused a bit of a time warp at times (for example the starred chat hats). Will this be true of the removal process as well?  Do we get our hats until 23:39 UTC Jan 4th, are they removed at the end of UTC Jan 3rd?
Page 105 of D. Burton's A First Course in Rings and Ideals reads     It is not difficult to show that if (I'll call them $n$ and $m$ instead of $n_1$ and $n_2$) $n$, $m$ are square free integers, then $\mathbb{Q}(\sqrt{n}) \cong \mathbb{Q}(\sqrt{m})$ if and only if $n=m$.   Well, it is getting difficult for me, any help or would be appreciated.    My progress so far: Suppose $\phi :\mathbb{Q}(\sqrt{n})\to\mathbb{Q}(\sqrt{m})$ is an isomorphism. Then $\phi(u)=u$ for every $u \in \mathbb{Q}$, so that $\phi(\sqrt{n})^2=\phi(n)=n$. If $\phi(\sqrt{n})=a+b\sqrt{m}$ for some $a,b\in\mathbb{Q}$, then $(a+b\sqrt{m})^2=a^2+b^2m + 2ab\sqrt{m}=n$ implies $$a^2+b^2m = n$$ and $$2ab=0.$$  Then $b=0$ cannot happen since that would imply that $\sqrt{n}\in\mathbb{Q}$, where $n$ is a square-free integer. Also $a=b=0$ cannot happen. Hence $a=0$ and we have $$b^2m=n.$$ If $\psi:\mathbb{Q}(\sqrt{n})\to\mathbb{Q}(\sqrt{m})$ were an isomorphism then there would exist some $s\in\mathbb{Q}$ such that $$s^2m=n,$$ then $s=b$ or $s=-b$. Therefore the only isomorphisms from $\mathbb{Q}(\sqrt{n})$ to $\mathbb{Q}(\sqrt{n})$ are $\phi(u+v\sqrt{n})=u+vs\sqrt{m}$ and $\psi(u+v\sqrt{n})=u-vs\sqrt{m}$.    I don't know if there's an easier way and I don't know if I'm in the correct way here. Thanks beforehand :) Present perfect for past action with present effect If I seem tired, can I say: "I haven't slept last night"? If not, why have I been told that we use present perfect for actions that have present effects? Setting the correct encoding when piping stdout in Python I am looking at collecting spatial information from a range of stakeholders to identify opportunities within a landscape.  However, the data that we are collecting are not presently mapped and so we wish to use an interactive method to get this information onto a map.  Which online websites/methods would people recommend for circulating to a non-technical audience to try and get them to map what they know?    Where the emphasis is on ease of use by the stakeholder. Can you flank with a reach weapon? The Variant: Flanking rules in the DMG (page 251) require adjacency, but is the intent that the Enemy has combatants on opposite sides and thus someone with Reach (and using the reach) could still flank even if not directly adjacent?  Looking for both RAW as well as Intent of the flanking rule. For only my index pages, I am receiving this warning in Google Search Console:     Duplicate, submitted URL not selected as canonical   I know that this occurs because Google is attempting to track both the default landing "page" (i.e. www.domain.example/) and the page to which to which DirectoryIndex points (i.e. www.domain.example/index.html). They are, in fact, the same page, and so the warning is the result of a false positive.  Two questions for our community:   Why does Google not conflate these and count them as a single page? Alternately, is there something wrong with my set up if this has happened? I can easily force both pages to point to a single canonical URL. But which is preferable, "/" or "index.html"? Is it possible to create an  shader in Cycles? Specifically for something like , , , etc.. uname -r and available linux-headers- packages do not match Let $f$ be differentiable at $x=a$.   Prove that if $x_n \to a^+$ and $y_n \to a^-$ then:  $$\lim_{n\to \infty} \frac{f(x_n)-f(y_n)}{x_n-y_n}=f'(a).$$  Every option that I think about seems to my very trivial, so I believe that I am doing something wrong.  Both numerator and denominator approach zero as $n\to\infty$ as the case of the formal definition of derivative, but it isn't guaranteed that the limits are equal (“$\frac{0}{0}$”).   Any direction? Intuition on the Kullback-Leibler (KL) Divergence Proof for Property of Complex Numbers Is the inequality $\lvert z_1 + z_2 \rvert \ge \lvert z_1 \rvert - \lvert z_2 \rvert$ incorrect, where $z_1$ and $z_2$ are any two complex numbers? I need an example to prove that it is. And in case it is correct, can you please give the proof? Thanks for any help. How is the amplitude of light related to number of photons? If you increase the number of photons leaving a light source you increase the brightness/intensity, so it could be said that intensity is directly proportional to number of photons. However intensity is directly proportional to amplitude squared, so this leads me to wonder that if you increase the amplitude of a light wave, are you just creating more photons rather than affecting each individual photon in some way? What happens 'internally' on a unstable/overclocked/undervolted CPU? When you undervolt or overlock an CPU, when it passes a certain limit it starts to make the system unstable, reboot, etc. But these are the effects of it.  What I'm curious about is what happens on the CPU. What happens? It gives wrong answers to instructions? Bits on cache flip? Is there any function that converts an escaped Url string to its unescaped form? System.Web.HttpUtility.UrlDecode() can do that job but I don't want to add a reference to System.Web.dll. Since my app is not a web application, I don't want to add a dependency for only using a function in an assembly.  UPDATE: Check  about the same issue. Unable to set placeholder on password input Converting a list of tuples into a dict I have a list of tuples like this:  [ ('a', 1), ('a', 2), ('a', 3), ('b', 1), ('b', 2), ('c', 1), ]   I want to iterate through this keying by the first item, so, for example, I could print something like this:  a 1 2 3 b 1 2 c 1   How would I go about doing this without keeping an item to track whether the first item is the same as I loop around the tuples? This feels rather messy (plus I have to sort the list to start with)... opengl storing multiple indices into indices buffer After parsing collada files I found out that we have to load two(or more) indices each pointing to say a vertex or normal etc. like this (&lt;p>3 0 2 0 0 0&lt;/p>)  Is there a way to load (and use)these indices to indices buffer(ELEMENT_ARRAY_BUFFER) like this (vnvnvn...) ; where v is vertex pointer, n is normal pointer from the above. with vertices loaded to VBO1 like (vvvv...) and in VBO2 like (nnnn...). So that we dont have to repeat the normals in VBO2.  VBO like (vnvnvn...) is also ok. (and not something like this ), I'm not trying to use multiple indices buffer. I'm trying to put all the given indices into one index buffer and use them alternately.  (If I wasnt clear i will try for more clarification.) Best way to recover mysql from a "chmod -R 777 /" with databases intact How can we compute the following limit:     $$\lim_{n\to\infty}(1+1/n^2)(1+2/n^2)\cdots(1+n/n^2)$$   Mathematica gives the answer $\sqrt{e}$. However, I do not know to do it. There are n letters addressed to n eople at different addresses. The n addresses are typed on n envelopes.  A disgruntled secretary shuffles the letters and puts them in the envelopes in random order, one letter per envelope.  Find the probability that at least one letter is put in a correctly addressed envelope. [Hint: use the inclusion-exclusion formula.] What is the probability approximately, for large n ?    My attempt at a solution:  P(all correct) = $\frac{1}{n!}$  P(n-1 correct) = ${n \choose n-1} \frac{1}{n!} = \frac{1}{1!(n-1)!}$  ${n \choose n-1}$ ways of selecting n-1 correct letters.  P(n-2 correct) = ${n \choose n-2} \frac{1}{n!} = \frac{1}{2!(n-2)!}$  ...  P(n-n correct) = ${n \choose n-n} \frac{1}{n!} = \frac{1}{n!(n-n)!} = \frac{1}{n!}$  This all looks ok to me, but I tested this for a case of 4 people, (I think the theoretical value should be $\frac{9}{24}$ but obviously that is not what I got. Can someone correct my logic please? Also, with regards to the hint about inclusion/exclusion - where would that come in?  I read about derangements on Wikipedia but it did not make total sense to me (the derivation).  I would appreciate any advice whatsoever including references to other material.