Why does printing the same byte array result in two differing strings when printed to the console?
What's the simplest way to print a Java array?
In the Harry Potter series, are wizards capable of creating their own spells, or are they limited to the spells that they're taught/learn?  I seem to remember something about Snape creating sectumsempra, but I'm not sure if that really is the case. Which is correct: "the below information" or "the information below"? How prove this equation $\alpha=\aleph_{0}\alpha$ Question:     let $\alpha$ be a infinite cardinal , show that:   $$\alpha=\aleph_{0}\alpha$$   where $\aleph_{0}$ is the cardinality of the natural numbers is denoted aleph-null   this equation is from a book,and I can't prove it,and the author say this is important equation,and can't prove it.Thank you for you help Let: $P(x) = a_nx^n + a_{n-1}x^{n-1} + ..... + a_1x + a_0$ where $a_0a_n &lt; 0$ I have to prove that the Polynomial $P(x)$ has at least one positive root how can I prove it? Any ideas? Do I have 32-bit or 64-bit? Proof that the Casimir invariant of a representation commutes with everything What is the difference between /sbin/nologin and /bin/false? I have often heard it recommended that a user account should be disabled by setting its shell to /bin/false. But, on my existing Linux systems, I see that a great number of existing accounts (all of them service accounts) have a shell of /sbin/nologin instead.  I see from the man page that /sbin/nologin prints a message to the user saying the account is disabled, and then exits. Presumably /bin/false would not print anything.  I also see that /sbin/nologin is listed in /etc/shells, while /bin/false is not.  The man page says that FTP will disable access for users with a shell not listed in /etc/shells and implies that other programs may do the same. Does that mean that somebody could FTP in with an account that has /sbin/nologin as its shell?  What is the difference here? Which one of these should I use to disable a user account, and in what circumstances? What other effects does a listing in /etc/shells have? As far as I understand, whatever can be done using DeclareMathOperator can also be achieved using newcommand, but not the other way around. If this is the case, what are the circumstances where DeclareMathOperator is the better choice? When should I take solely newcommand?  I found a question regarding , and I wonder what other aspects should be taken into consideration when it comes to choosing which method to use when defining math operators. I`m using the Newton-Raphson method for obtaining MLE for parameters for maximizing my objective function. At each iteration, I want to check that is the Hessian matrix negative definite or not and I see the Hessian matrix is not negative definite at some iterations. So, I want to use the Fisher scoring algorithm ( of derivation) In this situation, the Fisher information matrix is indefinite!! Is it possible? What are the reasons for this? Are the second-order derivatives wrong? Or are values of expectations incorrect? Best practices for storing UI settings? we're currently planning a larger WPF LoB application and i wonder what others think being the best practice for storing lots of UI settings e.g.   Expander States Menu orders Sizing Properties etc...   i don't like the idea of having dozens of stored values using the delivered SettingsProvider (i.e. App.config file) although it can be used to store it in an embedded database using a custom SettingsProvider. being able to use some kind of databinding is also a concern. Has anyone had the same problems?   What did you do to store lots of ui user settings? Javascript and PHP functions Is there a single word that describes both Witches and Wizards? In the Harry Potter world, there's the term "muggle" for people with no magical abilities, "muggle-born" for those with magical abilities who's parents are muggles and "squib" for those with no magical abilities who's parents are magical.  But is there any collective term for all magical people (as opposed to wizards for males and witches for females)?  I don't recall seeing any word that refers to all men and women and children with magical abilities, and it's the only group left without noun or collective noun to describe them. How can I reduce the ever-increasing time to push a subtree? Peggy would like to prove to Victor that she knows the discrete logarithm of $y$ based $g$; that is, she knows $x$ such that $y = g^x \bmod p$. One round of the interactive proof protocol consists of the following steps.   Peggy picks random $k \in \mathbb Z/(p−1)\mathbb Z$, computes $t = g^k \bmod p$, and sends $t$ to Victor. Victor picks random $h \in \mathbb Z/(p−1)\mathbb Z$ and sends $h$ to Peggy. Peggy computes $r = (k − hx) \bmod (p − 1)$ and sends $r$ to Victor. Victor verifies that $t = g^r y^h \bmod p$.   The interactive protocol can be converted into a noninteractive zero-knowledge proof by choosing and making public a collision-resistant hash function $H$, and changing the second step of the interactive protocol to the following: Peggy computes $h = H(y, t)$. Then the noninteractive proof consists of $(t, h, r)$, which can be verified as follows: $$h = H(y, t), \qquad t \stackrel?= g^r y^h \bmod p.$$   What is the problem if in the non-interactive proof the hash $h$ depends only on $y$? That is, $h = H(y)$, and the proof consists of $(t, h, r)$, which can be verified as follows: $$h = H(y), \qquad t \stackrel?= g^r y^h \bmod p.$$ What is the problem if in the non-interactive proof the hash $h$ depends only on $t$? That is, $h = H(t)$, and the proof consists of $(t, h, r)$, which can be verified as follows: $$h = H(t), \qquad t \stackrel?= g^r y^h \bmod p.$$ This question is in the spirit of , an example of an apparently non-deterministic system in Newtonian mechanics. Under certain restrictions, the  guarantees the existence and uniqueness of solutions to differential equations with initial conditions. However, Norton's dome does not satisfy these restrictions. The ball may sit on top of the dome for an arbitrary period of time before sliding down in a particular trajectory, without violating Newton's laws of motion.    Is there a plausible example of a system of interacting point-particles such that the equations of a point-particle are continuous but not , and therefore fail to have a unique solution? Create alphabetical pager We learned in Thor: Ragnarok that Mjolnir is only a focus for Thor's power, not the source. If so, when a worthy​ being lifts Mjolnir and gains "the power of Thor", where are they getting the power from? Why do I have two docks in Ubuntu desktop (with GNOME 3) after installing Dash to Dock? What's going on here? I've installed the  on Ubuntu 17.10. Everything was cool, and as I was trying to hone and tweak the look of my desktop, at some point the shortcuts bar (dock?) on the left is duplicated.  (Click image to enlarge) The default, which normally disappears with Dash to Dock, is there underneath the one that usually shows up when I install Dash to Dock. Why? I've tried to go through the options for Dash to Dock, the GNOME Tweak Tool, and the regular Ubuntu settings, but I can't figure it out. Questions with declarative forms have the same meaning as their interrogative counterparts or not? I'm using the listings package with this \begin command:  \begin{lstlisting}[caption=blabla, label=amb]   This yields a nice code listing with a caption like "Listing 1.1 blabla". Is there a way to change the caption and have something like "Code 1.1 blabla"?  I saw the title command but it doesn't use a numbering system. Any hint will be greatly appreciated!