Closing question as off-topic and not on a suggested site
Is an option missing in the new off-topic reasons?
Consider a particle in a potential well. Let’s assume it’s a simple harmonic oscillator potential and the particle is in its ground state with energy E0 = (1/2) &#8463;&omega;0. We measure its position (measurement-1) with a high degree of accuracy which localises the particle, corresponding to a superposition of momentum (and therefore energy) states.  Now we measure the particle’s energy (measurement-2) and happen to find that it’s E10 = (21/2) &#8463;&omega;0. Where did the extra energy come from?  In the textbooks it’s claimed that the extra energy comes from the act of observation but I wonder how that could work. Measurement-1 which probed the position of the particle can’t have delivered to it a precise amount of energy, while measurement-2 might just have been passive. No doubt there is entanglement here between the particle state and the measuring device but where, and which measurement? Redirect STDERR and STDOUT to different variables without temporary files How do I split a string, breaking at a particular character? I have this string  'john smith~123 Street~Apt 4~New York~NY~12345'   Using JavaScript, what is the fastest way to parse this into  var name = "john smith"; var street= "123 Street"; //etc... I need to find a reg ex that only allows alphanumeric. So far, everyone I try only works if the string is alphanumeric, meaning contains both a letter and a number. I just want one what would allow either and not require both. I just visited  and noticed that my profile picture is not the same as on all other sites.  According to  the image will be synchronized when synchronizing the complete profile. I did that but the image is still the same.  Then I wanted to change the image in the Area51 profile directly - but I can only change to a gravatar image and can't use the new and fancy Stack Exchange image.  Is that a bug? What makes a field not groupable I'm trying to use an aggregate query, but one of the fields I want to group by is not groupable (saw it in the soql error and then verified groupable=false in the metadata).  It's just a number field that holds an integer (number 2,0 in salesforce field spec-speak).  Is there a trick to make it groupable?  Any way around this problem? I don't want to write hundreds of lines of code just to average a list by this field. Proving $A+A'B=A+B$ without truth tables How can I prove the Boolean algebraic rule $$A+A'B=A+B$$ without using a truth table?  With the truth table, it is easy to see that the two are equal, but how can I prove it using lesser Boolean identities? What is the appropriate public key encryption for secure coin flipping? I quote Bobby's question here since I encountered the same one...    Consider the following protocol for two parties to flip a fair coin.   Trusted party $T$ publishes her public key $K_{pub}$ $A$ chooses a random bit $b_A$, encrypts it under $K_{pub}$, and announces the ciphertext $c_A$ to $B$ and $T$ $B$ does the same and announces a ciphertext $c_B$ (where $c_B \neq c_A$) $T$ decrypts $c_A$ and $c_B$, and announces the results. Both parties $XOR$ the results to obtain the random value $b_A\oplus b_B$.   It was shown that  was not appropriate for the encryption scheme.  seems to fail to work also. Since $c_A=m^e \mod N$. Then if $m=1$, $c=1$. If $B$ receives $A$'s cipher he will know the exact value of $m$.   So what should the appropriate encryption scheme be? My &quot;hat&quot; is shown twice in my answer, once in my sig, and again above. MacOS 10.14.6; Safari Version 14.0.2 (14610.3.7.1.10) Calculate Euler equations of fluid dynamics without division? I'm working on the calculation of the  with the . Unfortunately I'm not allowed to do a division. So I'm wondering if there's a form which does not need a division.  At the moment the Euler equations look like this:  $$ \frac{\partial}{\partial t} \begin{pmatrix} \rho \\ \rho v_1 \\ \rho v_2 \\ \rho v_3 \\ \rho E \end{pmatrix} = -\mathrm{div} \begin{pmatrix} \rho v_1 &amp; \rho v_2 &amp; \rho v_3 \\  \rho v_1^2 + p &amp; \rho v_1 v_2 &amp; \rho v_1 v_3 \\  \rho v_2 v_1 &amp; \rho v_2^2 + p &amp; \rho v_2 v_3 \\  \rho v_3 v_1 &amp; \rho v_3 v_2 &amp; \rho v_3^2 + p \\  (\rho E + p) v_1 &amp; (\rho E + p) v_2 &amp; (\rho E + p) v_3 \end{pmatrix} $$  As you can see, I first need to calculate $\frac{\rho v_1}{\rho}$ to get $v_1$ so I can calculate e.g. $\rho v_1^2$ How can I run Maniac Mansion through ScummVM? Day of the Tentacle Remastered Edition includes Maniac Mansion as a .  The game appears to be exactly the same as the old DOS release (albeit, the enhanced version).  If possible, how can I run this game through ScummVM?  Pointing ScummVM at my installed game doesn't work.  What do I need to do to play this version of Maniac Mansion? Conditional clause (then) In this first instance the main clause only stands alone if you  omit (then).  But in the other example it clearly has a main clause. So would this be classed as an embedded main clause as it only works as a independent clause if it's adjusted and or if it's joined with a dependent clause.  If I have enough money, then I will buy a new car.  If it rains, the picnic will be cancelled.  The picnic will be cancelled if it rains. How to load a taxonomy term with case-sensitive? I used this      $this-&gt;termStorage-&gt;loadByProperties(['name' =&gt; 'test']);   I got two terms: Test, test. I want to get only one: test  This is working without case-sensitive:       $this-&gt;termStorage-&gt;getQuery()-&gt;condition('name', 'test', '=')-&gt;execute();       \Drupal::database()-&gt;select('taxonomy_term_field_data', 't')       -&gt;condition('t.name', 'test')       -&gt;fields('t', ['name'])       -&gt;execute()       -&gt;fetchAll();       \Drupal::database()-&gt;query("SELECT name FROM taxonomy_term_field_data WHERE name='test'")-&gt;fetchAll(); Zorn's Lemma states that if every chain $C$ in a partially ordered set $X$ has an upper bound then there is at least one maximal element in $X$.  Let $n\in \mathbb{N}$, $C_n \subset \mathbb{N}$ be the set containing the natural numbers $\{1,\dots,n\}$. Then if $k\le n$, $C_k\subset C_n$, so $C_n$ is a chain. Also, $C_n$ has an upper bound, such as $n+1$. But what is the maximal element of $\mathbb{N}$?  There's something I don't get in Zorn's Lemma statement. How does the 'passwd' command gain root user permissions? How does Linux know that it has to give euid 0 (uid of root) to only certain process like passwd, setuid, etc.  If a process can gain root permissions, will it not lead to potential security breaches in the Linux platform?   For example, if I write a program that can can gain root user permissions like passwd, I may corrupt important system files like /etc/passwd, /etc/groups.   How does Linux manage to still be secure? In simple terms, what is the purpose of flush() in ostream Is any quotient of a Euclidean domain by a prime ideal a Euclidean domain? Let $R$ be a Euclidean domain, i.e., a ring with a norm $N : R \rightarrow \mathbb N$ such that for any $a,b\in R$ with $b\not=0$, we may write $a = qb + r$ for some $q,r \in R$ with $N(r) &lt; N(b)$. Let $I$ be a prime ideal of $R$, so $R/I$ is a domain. Must $R/I$ in fact be a Euclidean domain?   I know that this is true if we replace "Euclidean domain" with "PID", and false if we replace it with "UFD", so there is no clear intuition to be gained from similar concepts. My first attempts at a proof was to borrow a construction from analysis and define a norm on $R/I$ by  $N(a + I) = \inf\{N(a+i) : i\in I\}$  but this didn't really get me anywhere.   So, this fact true? If so, how can I prove it? If not, whats a counterexample? Execute shell script or command on idle time I'm searching for the possibility to execute a shell script or command based on idle time in the bash shell.  As an example, if I'm in a SSH session to a server of mine and after X minutes of inactivity in the terminal, I want a command to start a desired program like cmatrix, and when I come back and press a key I will get back where I left. Minecraft Inventory Saving Restrictive vs Non-restrictive Relative Clause