How to stop C# console applications from closing automatically?
Why is the console window closing immediately once displayed my output?
How to give an image or video a TV screen effect? Show that there are exactly 16 pairs of integers $(x,y)$ such that $11x+8y+17=xy$. Is it a good practice to always scale/normalize data for machine learning? I am currently using Ubuntu 12.04 because the latest upgrade 14.04 is not working in my system. I need to install the latest Adobe Flash Player 17 plugin, but it only allows me to install up to version 11.02, so media files cannot be opened. It says that Adobe Flash Player 17 is not compatible with my system. How to create a GUID/UUID in Python How do I create a GUID in Python that is platform independent? I hear there is a method using ActivePython on Windows but it's Windows only because it uses COM. Is there a method using plain Python? Not able to add 3 JPanels to a main panel Non-static variable cannot be referenced from a static context How to calculate time difference in java? Why does GPS depend on relativity? What will happen with Blender 2.8 game engine? Blender has just purged the entire game engine from 2.8. There is no "Game Engine" mode anymore and there isn't even a logic editor. I tried installing a GitHub Blender release with the game engine mode working but it failed to install because all the game code was gutted. Does this mean that Blender 2.8 is going to lose the game engine, or is the game engine just being redone for better compatibility and whatnot? Without solving the equation, show that all nine roots of $(𝑧 − 1)^{10} = 𝑧^{10}$ lie on the line $Re (𝑧) = \frac{1}{2}$ Problem: Without solving the equation, show that all nine roots of $(𝑧 − 1)^{10} = 𝑧^{10}$ lie on the line $Re(𝑧) = \frac{1}{2}$. I would like to say I tried something but I am actually clueless. I was thinking maybe I could use De Moivre's theorem but I am not sure how. Any hint would be appreciated. Understanding etoolbox \ifdefempty and \ifdefvoid I am trying to understand the  \ifdefempty and \ifdefvoid macros. The documentation says that \ifdefempty     Expands to true if the control sequence is defined and is a   parameterless macro whose replacement text is empty, and to false   otherwise.   Similarly \ifdefvoid     Expands to true if the control sequence is undefined, if is a macro   whose meaning is \relax, or a parameterless macro whose replacement   text is empty, and to false otherwise.   From these descriptions I thought that \def\myempty{}, \def\myrelax{\relax}, and \def\myemptyempty{\myempty} would all be both "empty" and "void", but \def\myempty{} is the only one that is either "empty" or "void". What am I missing?  \documentclass{minimal} \usepackage{etoolbox}  \begin{document}  \def\myempty{} \def\myrelax{\relax} \def\myemptyempty{\myempty}   \ifdefempty{\myempty}{Empty}{Not empty}  \ifdefempty{\myrelax}{Empty}{Not empty}  \ifdefempty{\myemptyempty}{Empty}{Not empty}  \ifdefvoid{\myempty}{Void}{Not void}  \ifdefvoid{\myrelax}{Void}{Not void}  \ifdefvoid{\myemptyempty}{Void}{Not void}  \end{document} Where can the viewport clipping parameters be changed? Zooming in to inspect texture details in 3D view clips some closer faces like shown in the image. It's not the camera view so changing camera settings doesn't help.   Where can the distance to the clipping plane be adjusted? I'm wanting to parse a string into a nullable int in C#.  ie. I want to get back either the int value of the string or null if it can't be parsed.  I was kind of hoping that this would work  int? val = stringVal as int?;   But that won't work, so the way I'm doing it now is I've written this extension method  public static int? ParseNullableInt(this string value) {     if (value == null || value.Trim() == string.Empty)     {         return null;     }     else     {         try         {             return int.Parse(value);         }         catch         {             return null;         }     } }      Is there a better way of doing this?  EDIT:  Thanks for the TryParse suggestions, I did know about that, but it worked out about the same.  I'm more interested in knowing if there is a built-in framework method that will parse directly into a nullable int? Subgradients of non-convex functions In  (section 2.3), it is stated that:     A point $x^*$ is a minimizer of a function $f$ (not necessarily convex) if and only if $f$ is subdifferentiable at $x^*$ and $0 \in\partial f(x^*).$   Could anybody provide me with references for a proof of the above statement?   Is there a reference where we can learn more about subgradients of non-convex functions?  In Section 3. Calculus of subgradients of the above notes,many properties of subgradients are presented for convex functions. I would like to know which ones among these properties still hold for non-convex functions.  Thank you in advance! Solving $f(x+y) = f(x)f(y)f(xy)$ Alien invasion movie, giant robot aliens with long legs capturing people So I saw this movie about 10 years ago, when I was about 5 years old. Since I was really young, my memory of it isn't really that great.   I think it may have been an alien invasion movie, but the only scene I remember is that there were these giant robot-alien things:   I think they had several long legs. They had a big glass dome on top of them They would grab civilians and drop them in their glass dome.   That's all I remember. If you could please help me out, that would be great.   Again, I was about 5 years old when I watched it, so my memory of it isn't that great, but I hope you know what I'm talking about. Thanks so much :) What conditions are necessary for a Wither Skeleton to spawn naturally, and can I manipulate those conditions to increase the chance of them spawning?  I want to make a Wither Skeleton spawning pad in the Nether but I'm having trouble finding Wither Skeletons. I've only heard that they spawn in Nether Fortresses. "std::endl" vs "\n" Many C++ books contain example code like this...  std::cout &lt;&lt; "Test line" &lt;&lt; std::endl;   ...so I've always done that too. But I've seen a lot of code from working developers like this instead:  std::cout &lt;&lt; "Test line\n";   Is there a technical reason to prefer one over the other, or is it just a matter of coding style? Combinatorics Question Asking How Many Integer Solutions Given Different Restrictions How many integer solutions of $x_1 + x_2 + x_3 + x_4 = 28$ are there with:  (a) $0 ≤ x_i ≤ 12$?  (b) $−10 ≤ x_i ≤ 20$?  (c) $0 ≤ x_i, x_1 ≤ 6, x_2 ≤ 10, x_3 ≤ 15, x_4 ≤ 21$?  \ \  My attempts (I was really only able to solve part (a) but I would appreciate if you could check my work for this one as well):  (a) First I took the total number of integer solutions with no restrictions: There would be ${28+3\choose 3}$ = ${31\choose 3}$ total solutions with no restrictions.   Then I used the inclusion exclusion principle and knew I would have to subtract [P(A) + P(B) + P(C) + P(D)] where A --> $x_1$ is greater than or equal to 13, ..., D--> $x_4$ is greater than or equal to 13. The probabilities of all these cases would equal ${15+3\choose 3}$ = ${18\choose 3}$ because once we assign 13 to one of the $x_i$ there would be $28 - 13 = 15$ remaining to distribute among the $x_i$ values. We would also need to choose which of the $x_i$ to give the 13 to so we would multiply the ${18\choose 3}$ by ${4\choose 1}$ = ${4\choose 1}{18\choose 3}$  We would then have to add back, since we "oversubtracted", the case in which there is an intersection between two of the $x_i$ or in other words two of the $x_i$ receive 13 or more. P$(A\bigcap B)$ = $28-2(13) = 2$ remaining to distribute among the $x_i$ values. So we would also have to choose which of the $x_i$ to give the 13 to so we would have ${4\choose 2}$ ways to choose them. So there would be ${4\choose 2}{2+3\choose 3}$ = ${4\choose 2}{5\choose 3}$ solutions in this case.   Thus the number of solutions would be: ${31\choose 3} - {4\choose 1}{18\choose 3} + {4\choose 2}{5\choose 3}$.  I'm not sure if this is correct and I'm really stuck on b and c so I would appreciate any help or feedback. Thank you!