i need help with minecraft multiplayer I just got my account today and I am trying to join a server and it says the authentication servers are down and I checked more than once to see if it's online and I still cannot join please help
Is there a list of error codes for Minecraft? Similar to  on the bugs in Minecraft, I would like a complete list of what error codes exist in Minecraft and how they occur, as well as how they can be resolved.
Which has the heavier tail, lognormal or gamma? (This is based on a question that just came to me via email; I've added some context from a previous brief conversation with the same person.)  Last year I was told that the gamma distribution is heavier tailed than the lognormal, and I've since been told that's not the case.   Which is heavier tailed? What are some resources I can use to explore the relationship? So assume $Y$ and $X$ are exponentially distributed with parameters $y_1$, and $x_1$ respecitively.  assume c is a constant.  I am having huge trouble to understand the integration of the following expression.  $P(Y&lt;c/u(X))$  $=\int_{t}^{\infty}f_X(x)\int_{0}^{c/u(x)}f_Y(y)dydx +\int_{0}^{t}f_X(x)\int_{c/u(x)}^{\infty}f_Y(y)dydx$  where t is the cross-point that $u(x)$ change sign    here $c/u(x)$ is given by the plot below, t is the point crossing the zero:   Confusion:   I don't understand the second integration of the second term "$\int_{c/u(x)}^{\infty}f_Y(y)dydx$", this isn't right because Y an X only defined for y>0, and x>0. So it's the first quadrant in this plot. (I'm going to link to this Stackexchange post concerning Nullary Operations: )  In general an  is a function $f:S^n \to S$, where $n$ denotes the arity of the operation, and a  is a function $f:S^0 \to S$.  It is clear that $S^n=S \times S \times \cdots \times S$ denotes the Cartesian product of a set with itself ($n$ times), however $S^0$ makes little sense to me.  One might define $S^0=\emptyset$. At first glance, that seems like a good choice. However then a nullary operation makes no sense, since it must be a function $f: A \to B$ where $A$ and $B$ are two sets representing the domain and codomain of the function. And note a function is defined in terms of relation, where a relation is a subset of the Cartesian product $A \times B$. So when we think of $A=S^0=\emptyset$ and $B=S$, so that we have a nullary operation $f:\emptyset \to S$, what is a a subset of $\emptyset \times S$? What even is $\emptyset \times S$? By definition of the Cartesian product, \begin{equation} \emptyset \times S = \{(a,b):a \in \emptyset\textrm{ and }b \in S\}. \end{equation} But there exists no $a \in \emptyset$! Therefore there exist no ordered pairs in our Cartesian product! Therefore $\emptyset \times S = \emptyset !$. Remember a function is a relation which is a subset of the Cartesian product. Therefore our relation is the empty set, and therefore also $f=\emptyset$.    Edit: We got the definition sorted out in the comments. Thanks especially to Hayden and Christoff for their great help. In summary, we figured out that $S^0=\{()\}$, the set containing only one element, the "empty $n$-tuple". Then if taking $S=\{1,2,...,k\}$, then a nullary operation $f:S^0 \to S$ is a function, i.e. some subset of $S^0 \times S = \{()\} \times S$. Looking at $\{()\} \times S$, this equals $\{((),1),((),2),...,((),k)\}$. Then a function is a special subset of this, so that each element of the domain (and there is only one element, namely $()$) is paired with exactly one element of the codomain. Therefore a function would have the form $f=\{((),a)\}$ where $a$ is one of $1,2,...,k$. Thank you for your help. Does the Great Old One warlock's telepathy from the Awakened Mind feature take an action? Does the Great Old One warlock's telepathy from the Awakened Mind feature take an action?  It doesn't seem too clear to our group and we have basically ruled it as equivalent to talking. if G is generated by {a,b} and ab=ba, then prove G is Abelian if G is generated by {a,b} and ab=ba, then prove G is Abelian  All elements of G will be of the form $a^kb^j,\,\, k,j \in \mathbb{Z}^+$   so I need to get $a^kb^j = b^ja^k$ Of course most languages have library functions for this, but suppose I want to do it myself.  Suppose that the float is given like in a C or Java program (except for the 'f' or 'd' suffix), for example "4.2e1", ".42e2" or simply "42". In general, we have the "integer part" before the decimal point, the "fractional part" after the decimal point, and the "exponent". All three are integers.  It is easy to find and process the individual digits, but how do you compose them into a value of type float or double without losing precision?  I'm thinking of multiplying the integer part with 10^n, where n is the number of digits in the fractional part, and then adding the fractional part to the integer part and subtracting n from the exponent. This effectively turns 4.2e1 into 42e0, for example. Then I could use the pow function to compute 10^exponent and multiply the result with the new integer part. The question is, does this method guarantee maximum precision throughout?  Any thoughts on this? What do we lose passing from the reals to the complex numbers? As normed division algebras, when we go from the complex numbers to the quaternions, we lose commutativity. Moving on to the octonions, we lose associativity. Is there some analogous property that we lose moving from the reals to the complex numbers? 32-bit, 64-bit CPU op-mode on Linux I'm confused. Running Fedora Linux, lscpu yields:  Architecture:            i686 CPU op-mode(s):          32-bit, 64-bit ...   But when I try to install a 64-bit program (Chrome) I get error like:     Package /....x86_64.rpm has incompatible architecture x86_64. Valid architectures are ['i686', 'i586', 'i486', i386']   I'm less interested in being able to install Chrome and more interested in why lscpu says that my CPU can run in 64-bit mode; clearly this can't mean I can run 64-bit programs. Can anyone clarify? If $l$ and $n$ are any positive integers, is there a  proof of the identity     $$\sum_{k=0}^{n}(-1)^{k}\binom{n}{k}(l-k)^n=n!\;$$   which uses the Inclusion-Exclusion Principle?  (If necessary, restrict to the case where $l\ge n$.)    This question is closely related to   and also Yesterday, I've listened to a song called "Fear not this night". I find the syntax unusual (as a foreigner, I have never encountered it). Is it the same meaning as "Don't fear this night" ? What's the slight difference between these 2 ?  Thank you for your time. Is a DNA molecule a single strand of polynucleotide or two of them linked together? Our molecular biology teacher told us that a double helix of DNA was composed of two DNA molecules linked together by hydrogen bonds. The thing is, until now, I always thought a DNA molecule was composed of two strands, those being polynucleotides, both of them being linked together. I can't find a link which is saying the same as my teacher, even if it seems technically correct to call a double helix a dimer of two DNA molecules.  I was curious to know what was the exact terminology. Can $R \times R$ be isomorphic to $R$ as rings? map to drive on server with bat file I have a web server that I want to map a drive to it. I want to do this in a .bat file. Pseudo ->   Check if a drive at an ip address has been mapped to a local drive.  If it has then progress with a reference to the drive If not map to a local drive and then progress with a reference to the drive  Is this possible and if so how can I achieve it? Finish an activity after a time period No sound after upgrade to 18.10, only a dummy device is shown After I updated to Ubuntu 18.10 my sound device isn't recognized anymore. Only a dummy device is shown.  I have an onboard Intel device:  lspci -nnk | grep -A2 Audio 00:1b.0 Audio device [0403]: Intel Corporation 7 Series/C216 Chipset Family High Definition Audio Controller [8086:1e20] (rev 04)     Subsystem: Intel Corporation 7 Series/C216 Chipset Family High Definition Audio Controller [8086:2036]     Kernel driver in use: snd_hda_intel     Kernel modules: snd_hda_intel   The command pacmd list-cards does not show any devices:  :~$ pacmd list-cards 0 card(s) available.   This message in /var/log/syslog might have to do something with the problem:  Oct 19 21:02:06 MyComputerName pulseaudio[14331]: E: [pulseaudio]  backend-ofono.c: Failed to register as a handsfree audio agent with  ofono: org.freedesktop.DBus.Error.ServiceUnknown: The name org.ofono  was not provided by any .service files   Does anybody have the same issue? How can I fix this? NOTE: Signing up or Logging in via OpenID is no longer officially supported from any of our sites. Currently,  is still on the internet, but we are in the process of completely removing it.    Stack Overflow was an early and strong supporter of . We built our sign up/log in flow around it. We were idealistic and had , but these hopes weren't realized. Over the years people have wondered if  is . We've had to remove support as OpenID providers  or .  The time has come to part ways. The reality is OpenID support has created a ton of complexity in our codebase and the number of users actively using OpenID simply don't justify that cost. Users have spoken with their actions. You prefer Google, Facebook and Stack Exchange (aka email/PW) based account auth.     Of our 9,813,747 accounts around one-tenth of a percent are actively using OpenID (defined as having visited a site in the past 12 months). If you include all the inactive accounts it is still less than 2.9% of all accounts.  So, what is the plan?   DONE - Remove the ability to create a new account with most OpenID providers DONE - Add the ability to  DONE - Convert Launchpad (used on  ) to OAuth DONE - Remove creating new accounts with Steam from  (Steam removed support for OAuth. Only 454 accounts that use Steam have visited Arqade in the past 6 months.) DONE - We will email all users that rely on deprecated OpenID credentials and request that they  DONE - Run an announcement banner for any user who signs in with deprecated OpenID credentials urging them to  DONE - End support for logging in via OpenID  In progress - Remove  (note: only 0.2% of authorized sites in the last year have been non-Stack Exchange sites.)   Obviously, if your account relies on OpenID, then make life easy and go now and .   If you've forgotten what you credentials you use to login, then  to refresh your memory. If you don't see one of the three account types shown in the image below (Google, Facebook or Stack Exchange) then click the "add more logins" button to add one of them to your account.    Remember, SE OpenID accounts are really email/pw accounts handled through complicated OpenID code path. They will be migrated to a simpler email/pw only code path as a part of this change. No extra work required on your part. Why do ssh operations always ask for passphrase? (with ed25519) I just updated my ssh key and added a passphrase, however it constantly nags me for it now, such as when I do a git (or mercurial hg) push.  ssh-agent is running:  xxx  1303  1118  0 09:16 ?  00:00:00 /usr/bin/ssh-agent    /usr/bin/dbus-launch --exit-with-session     /usr/bin/im-launch mate-session   I tried ssh-add:  &gt; ssh-add Identity added: /home/…/.ssh/id_rsa (/home/…/.ssh/id_rsa) Enter passphrase for /home/…/.ssh/id_ed25519:  Could not add identity "/home/…/.ssh/id_ed25519":      communication with agent failed   What is missing?  16.04 Ubuntu Mate, in case it matters. An inequality about Stirling numbers For all positive integers $n,r,k$ that $n=rk$, how to prove the inequality $$(r-1)!^k\le \frac{c(n,k)}{S(n,k)}\le (n-k)!$$ $c(n,k)$ is unsigned Stirling numbers of the first kind and $S(n,k)$ is Stirling numbers of the second kind.  Any help would be appreciated! Is there any web browser with NPAPI plugins support? As per  article, Mozilla has dropped the support of NPAPI plugins from Mozilla Firefox version 52. Is there any web browser with NPAPI plugin support? I have to use a website frequently, which uses Oracle Java plugin. I'm using Ubuntu 16.04 64 bit with Java JDK 8u121. Helps are much appreciated. Thanks. Edit1: After 3 years of asking this question, Java plugin still works fine in Palemoon v28.9.2-1 64 bit on Ubuntu 20.04 LTS. Java version is JRE 8u251 64 bit Edit2: As of 20th October 2020, Oracle completely removed Java Plugin from 8u271 JRE and JDK packages mentioned in  article. But 8u261 or prior versions works just fine. Showing that a sequence is monotone and thus convergent Here's the original question:     Let $(a_n)$ be bounded. Assume that $a_{n+1} \ge a_{n} - 2^{-n}$. Show   that $(a_n)$ is convergent.   Okay, I know that if I can show that if the sequence is monotone, I can conclude that it is convergent. But I am not sure how to show that it is monotone.  I know that  $$a_n \le a_{n+1} + \frac{1}{2^n} &lt; a_{n+1} + \frac{1}{n}$$  It looks to me as if it is monotonically increasing but I'm quite not sure how to prove my claim. Any hints would be appreciated.