I want to join the Hypixel server, but I can’t figure out how to add it.  Is it possible? If so, how do I do it?
Can players on a PC and an Xbox play together in any way? I.e. can Xbox users connect to a (modfied?) PC server, or vice versa?
Client should send one big packet or multiple smaller ones per frame? The client can do several actions per frame, for instance, requesting a movement, shooting etc. Should i send a packet to the server for each action the client performed during the frame, or should i stack them in an unique packet and send it at the end of the frame?  EDIT: i'm using Jmonkeyengine and the provided network API SpiderMonkey. The ^^ notation in various engines Basically, how does the ^^^... notation work in LuaTeX and XeTeX, exactly?  In 8-bit TeX engines (recent TeX, eTeX, pdfTeX, at least), two consecutive identical catcode 7 characters (typically ^), followed by two lowercase hexadecimal digits, are converted before the tokenization step to the corresponding byte.  Namely, ^^6f is exactly equivalent to o: for instance, \sh^^6fw ^^6f will cause TeX to show the letter o.  There is also the notation with two ^ (identical catcode 7 characters), followed by any ascii character (but not two lowercase hexadecimal digits), which is replaced by the character obtained by either subtracting or adding 64 to the character code, remaining among ASCII characters (range 0 to 128).  Unicode-aware engines (I'm thinking of LuaTeX and XeTeX, there are perhaps other less known ones around) also provide ^^^^xxxx and ^^^^^xxxxx for characters whose hexadecimal representation has 4, or 5 digits.  But this does not seem to be done in the same way across engines.  For instance, both LuaTeX and XeTeX appear to accept the notation with 4, 5, or 6 carets followed by the same number of hexadecimal digits, but XeTeX also accepts it for 3, while LuaTeX doesn't. Compiling the following with pdfTeX, LuaTeX, and XeTeX gives different results.  \catcode0=12 \newlinechar=10 \def\loopshow#1{\message{\meaning #1^^J}\loopshow} \loopshow \/   ^^56   ^^^056   ^^^^0056   ^^^^^00056   ^^^^^^000056   ^^^^^^^0000056 {\end\iffalse} \fi} \bye   One weird fact about XeTeX (a bug?) is that  \show ^^^^^^010101   shows the character displaywidth.  My goal (there may be a better way to do this) is to provide a way to test whether passing a given list of tokens through \scantokens is safe.  For that, my plan is to go through the \detokenized token list one character at a time, applying TeX's rule for tokenizing (but no need to fully tokenize), and detecting begin-group and end-group tokens, as well as invalid characters. heredoc for Windows batch? Does JavaScript have the interface type (such as Java's 'interface')? Can't install aircrack-ng Whenever I attempt to install aircrack-ng in terminal I get the following error:  Package aircrack-ng is not available, but is referred to by another package. This may mean that the package is missing, has been obsoleted, or is only available from another source However the following packages replace it:   iw  E: Package 'aircrack-ng' has no installation candidate"   I'm new to Ubuntu and so have no idea what to do. Get a generic method without using GetMethods I want to get the method System.Linq.Queryable.OrderyBy&lt;T, TKey&gt;(the IQueryable&lt;T&gt; source, Expression&lt;Func&lt;T,TKey&gt;&gt; keySelector) method, but I keep coming up with nulls.  var type = typeof(T); var propertyInfo = type.GetProperty(group.PropertyName); var propertyType = propertyInfo.PropertyType;  var sorterType = typeof(Func&lt;,&gt;).MakeGenericType(type, propertyType); var expressionType = typeof(Expression&lt;&gt;).MakeGenericType(sorterType);  var queryType = typeof(IQueryable&lt;T&gt;);  var orderBy = typeof(System.Linq.Queryable).GetMethod("OrderBy", new[] { queryType, expressionType }); /// is always null.   Does anyone have any insight? I would prefer to not loop through the GetMethods result. I am trying to solve the following question which is Ex3 from Arthur Engel, Problem Solving strategies. Here is the question: $\sum_{k=1}^n k^3 {n \choose k}$ and asks to find the sum. I am sincerely having a hard time trying to figure out how to solve it and get $n^2 (n+3)(2)^{n-3}$. I would really appreciate if someone could show the step-by-step process. Thank you! Word to describe using sarcasm or a similar approach to lead someone to recognise their own mistake How to get multiple selected values of select box in php? Applying options to already loaded package Is there a way to apply some options to a package which is loaded in the cls file I am using? For instance, suppose that the cls file loads graphicx, and I want to apply the option demo to it from my tex file. Initializing a member array in constructor initializer Why is log-of-sum-of-exponentials $f(x)=\log\left(\sum_{i=1}^n e^ {x_i}\right)$ a convex function for $x \in\mathbb R^n$? How to prove $f(x)=\log\left(\displaystyle\sum_{i=1}^n e^{x_i}\right)$ is a convex function?  EDIT1: for above function $f(x)$, following inequalities hold:  $$\max\{x_1,x_2,\ldots,x_n\}\leqslant f(x)\leqslant\max\{x_1,x_2,\ldots,x_n\}+\log n$$  and I have tried proving its convexity via definition of a convex function with above inequalities, but that didn't work.  EDIT2: I have posted my answers below. How do popular free RAW editor/converter compare to each other on Windows? I'm looking for a free RAW editor/converter on Windows. Can you tell me some strong/weak points of them comparing with Capture NX and/or Adobe Photoshop Elements?       - conversion &amp; EXIF  - white balance  - registration not possible anymore   EXIF editing would be a nice bonus.  Related: I'm trying to load data from different tables using left outer joins into a QgsVectorLayer. The approach I'm following so far is the one from the developers cookbook . The underlying database is postgres. The query returns correct data, including a geometry column, however I can't figure out how to get the join inside the query to work with . As the table the data come from needs to be specified, is it even possible to do so?  Would approaching the problem using psycopg2 be more suited, and if so, is there a way to create a layer from the result set? The only way I can think of is creating an empty layer and adding each feature individually by looping over the result set. But possibly there is an easier way?  Sadly, using the builtin DB Manager is not an option. The layer has to be added programmatically. Is there any way to find out what happened to a post card sent from other country? How do I run a GUI app via SSH? Convergence in probability implies convergence on a subsequence almost surely.  But this means we fix a subsequence, such that $X_{n_k}$ converges for almost every $\omega$, right? The subsequence we pick does not depend on the $\omega$ right? If $\Gamma$ is satisfiable then $\Gamma$ is consistent We say that $\Gamma$ is consistent if for no $\phi$, then both $\Gamma\vdash \neg\phi$ and $\Gamma\vdash\phi$. We say that $\Gamma$ is satisfiable if there is a structure $M$ s.t. $\models_M\gamma[s]$ for alle $\gamma\in\Gamma$.  I want to show that if $\Gamma$ is satisfiable, then $\Gamma$ is consistent.  I'm thinking we assume that $\Gamma$ is not consistent, and then show that $\Gamma$ is not satisfiable. So if $\Gamma$ is not consistent then both $\Gamma\vdash \neg\phi$ and $\Gamma\vdash\phi$ for some $\phi$. But by soundness theorem then $\Gamma\models\neg\phi$ and $\Gamma\models\phi$, meaning for structure $M$, we have $\models_M\neg\phi[s]$ (whereas $\not\models_M\phi[s]$) and $\models_M\phi[s]$. So would this mean that $\Gamma$ is not satisfiable? I'm a little confused, because wouldn't this instead be a contradiction? I live in a town where fresh or whole milk is not readily available. I was wondering if I could make cheese from UHT Milk. If so, what kind of cheese and what method I should use? Or rather, Should I? Cauchy-Schwarz inequality proof (but not the usual one) Before you downvote/vote-to-close, I am not asking for a proof of: $$\sum^n_{i=1}a_ib_i\le\sqrt{\sum_{i=1}^na_i^2}\sqrt{\sum^n_{i=1}b_i^2 } $$ Which is what EVERY link I've found assumes is the inequality (for a proof of that see:  )    I am reading a book that claims the Cauchy-Schwarz inequality is actually: $$\vert\langle x,y\rangle\vert\le\Vert x\Vert\Vert y\Vert$$ where $\Vert x\Vert :=\sqrt{\langle x,x\rangle}$  with the additional claim: equality holds $\iff\ x,y$ are linearly dependent  I cannot find a proof of this claim (only proofs for the dot product inner product). My question is: what is the simplest way to prove this (I define simplest to mean "using as few definitions outside of the inner product itself as possible" - so that's not including Gramm-Schmitt orthonormalisation, for example.)  I've just found some possible answers in the links on the right (annoyingly) but fortunately I have a second, albeit softer, question:  What inequalities that are common for say $\mathbb{R}^n$ are actually based on the inner product?   (In future I will check this site first, I was targeting lecture notes and such in my search)  Addendum: I want to use this on not-finite dimensional vector spaces. I've found one proof that relies on finite-ness.