This is possibly a stupid question, but one I have been always wondering. What would happen to me if I was in the center of the Large hadron Collider while it was running? Would the energy of the beam cause any short-term or long-term damage?
Some speculation here:   Is there a possibility it would pass 'undetected' through your hand, or is it certain death?  Can you conclude it to be vital, or only loose your hand?  Would it simply make a small cylindrical hole through your hand, or is there some sort of explosion-effect?  Assume your hand has a cross section of 50cm², and a thickness of 2cm, how much of the beam's energy would be transferred to your hand?
$f$ bounded but $f'$ isn't Does anyone know why typedefs of class names don't work like class names for the friend declaration?  class A { public: };  class B : public A { public:    typedef A SUPERCLASS; };  typedef A X;  class C { public:    friend class A;             // OK    friend class X;             // fails    friend class B::SUPERCLASS; // fails }; Regular cast vs. static_cast vs. dynamic_cast I've been writing C and C++ code for almost twenty years, but there's one aspect of these languages that I've never really understood. I've obviously used regular casts i.e.  MyClass *m = (MyClass *)ptr;   all over the place, but there seem to be two other types of casts, and I don't know the difference. What's the difference between the following lines of code?  MyClass *m = (MyClass *)ptr; MyClass *m = static_cast&lt;MyClass *&gt;(ptr); MyClass *m = dynamic_cast&lt;MyClass *&gt;(ptr); Evaluating a mathematical expression in a string Why the default eth0 interface is down by default on CentOS? Travelling in Schengen area while waiting for permit of stay renewal in Italy Why did the Ministry of Magic choose an ax for carrying out a death sentence? Proving the inequality $\frac{n^k}{k^k}\leq\binom{n}{k}\leq\frac{n^k}{k!}$ involving binomial coefficient. What is the best way of proving inequalities including binomial coefficients in general? Lets look at this example:     $$\frac{n^k}{k^k}\leq\binom{n}{k}\leq\frac{n^k}{k!}$$   What I started with is:  $$\binom{n}{k}\frac{1}{n^k}\leq\frac{1}{k!}$$ $$\frac{n!}{k!(n-k)!}\frac{1}{n^k}\leq\frac{1}{k!}$$ $$\frac{(n-1)!}{(n-k)!n^{k-1}}\leq1$$ This is where I got stuck. How can I prove that is is lower than or equal to 1? Could you give me a hint? My professor sometimes asks me to referee papers for him.  Should I list the corresponding journals in the professionals activity section of my CV? If $\sin(a)\sin(b)\sin(c)+\cos(a)\cos(b)=1$ then find the value of $\sin(c)$ SQL Server: Extract Table Meta-Data (description, fields and their data types) mariadb Unknown system variable 'server_uuid' Im trying to setup replication between mariadb(10.1.31-MariaDB - MASTER) and mysql(5.7.12-log - SLAVE). After executed the start slave, I got the below error.     Fatal error: The slave I/O thread stops because a fatal error is   encountered when it tries to get the value of SERVER_UUID variable   from master.   Then I tried to get the value of master_uuid.  MariaDB [(none)]&gt; show variables like '%server_uuid%'; Empty set (0.00 sec)   Then tried to setup this in mysql prompt.  MariaDB [(none)]&gt; set global  server_uuid = 11123c25-cac0-3523-8089-4c54d9b46f33; ERROR 1193 (HY000): Unknown system variable 'server_uuid'   And also I tried to setup auto.cnf in data directory.  [auto] server_uuid = 11123c25-cac0-3523-8089-4c54d9b46f33  chmod 644 auto.cnf   But still im getting the fatal error is encountered when it tries to get the value of SERVER_UUID variable from master. How to remove duplicate values from a multi-dimensional array in PHP How can I remove duplicate values from a multi-dimensional array in PHP?  Example array:  Array (     [0] =&gt; Array     (         [0] =&gt; abc         [1] =&gt; def     )      [1] =&gt; Array     (         [0] =&gt; ghi         [1] =&gt; jkl     )      [2] =&gt; Array     (         [0] =&gt; mno         [1] =&gt; pql     )      [3] =&gt; Array     (         [0] =&gt; abc         [1] =&gt; def     )      [4] =&gt; Array     (         [0] =&gt; ghi         [1] =&gt; jkl     )      [5] =&gt; Array     (         [0] =&gt; mno         [1] =&gt; pql     )  ) Can I transfer my Terraria character from one PC to another? Currently my map server is run on my laptop at home, and my brother and I play via LAN each on his desktop PC.  However, I'd like to transfer my character from the Desktop PC to my laptop in order to play on the go.  Can I do this? Where is the character information saved? Duplicate application icons in Ubuntu dock upon launch I'm using Ubuntu 17.10 with GNOME shell and Numix-Circle icon theme.   When I hover over the Numix icon for Nightly Web Browser, which is pinned to the dock I get the title "Nightly Web Browser".      But when I launch the program, another icon pops up at the bottom, with the name "Nightly". Linear Algebra: If $A^3 = I$, does $A$ have to be $I$? Can an observed event in fact be of zero probability? Can an observed event in fact be of zero probability?  Of course, I know that there exist non-empty events of zero probability. Mu question is the reverse: given that we have observed an event (and we have no other information about it, just the fact that it has been observed), is it possible that the event has in fact zero probability? Or does an observation necessarily mean that the probability is strictly positive?    Example context for the question:  Suppose $x_i$ (countably many) are i.i.d on $[0,1]$, but we do not know the distribution they come from. It may be uniform on $[0,1]$, may be discrete, may be any legitimate distribution (discrete or continuous). Just imagine we have some sort of a machine that shows us one by one a list of randomly drawn numbers between $0$ and $1$. We are comparing the observed numbers one by one to some special number chosen beforehand, for example $\frac12$. Now, given that at some iteration we have observed that special number at least once, does that mean that $\frac12$ has some positive probability under that (unknown) distribution? And if the probability can be zero, can we nevertheless say that we will necessarily observe $\frac12$ again later, if we continue the experiment ad infimum?  Also, disregard the "real world limitations" such as an inability to produce truly uniformly distibuted numbers, or rounding errors or any such thing. I recently upgraded a c# windows service to run as a 64 bit .net process. Normally, this would be trivial, but the system makes use of a 32-bit DLL written in C++. It is not an option to convert this DLL to 64 bit, so I wrapped the DLL in a separate 32 bit .net process and exposed a .net interface via remoting.  This is quite a reliable solution, but I would prefer to run the system as a single process. Is there any way I can load my 32 bit DLL into a 64 bit process and access it directly (perhaps through some sort of thunking layer)? Right identity and Right inverse implies a group Let $(G, *)$ be a semi-group. Suppose   $ \exists e \in G$ such that $\forall a \in G,\  ae = a$;  $\forall a \in G, \exists a^{-1} \in G$ such that $aa^{-1} = e$.    How can we prove that $(G,*)$ is a group? It seems that they can all mean "easily provoked to anger"  irascible：Easily provoked to outbursts of anger; irritable.  fractious：Irritable; argumentative; quarrelsome.  irritable：1.Capable of being irritated. 2.Easily exasperated or excited.  atrabilious：1.Characterized by melancholy. 2.ill-natured; malevolent.