how to make curve bevel turning evenly?
How can I make a perfect sweep with bevel object in Bezier curve(3d) (Pipe)
How do I build a house for my NPCs? change environment of a running process How might it be possible to alter some variable in the env of an already running process, for example through /proc/PID/environ? That "file" is read-only.  Need to change or unset the DISPLAY variable of a long-running batch job without killing it. I have to resit a calculus exam and for some reason set proofs were never my best friend...  Anyway, on a practice exam I encountered the following proof:  $$A\cap(B\cup C) = (A\cap B)\cup(A\cap C)$$  When I draw a Venn-diagram it seems quite obvious but I couldn't manage to write the proof down properly.  If someone could help me, that'd be great! Simple PHP Pagination script Wrap Caption Around TikZ Figure I was going through the fundamental theorem in Number Theory where any non zero integer n can be represented as a product of distinct primes. A related problem with this theorem is to prove that for every such number, there exists a prime $p$ such that $p&lt; \sqrt n$. I was wondering if there is any mathematical proof that no prime $p$ exists for the number $n$ such that $p&gt; \sqrt n$. Is `sudo pip install` still a broken practice? "Didn't use to get" or "Didn't used to get"? I just made a minor , and  the grammar correction was unnecessary.  The original text was     Another factor--sometimes life happens and you can't fly. In the old days you could simply sell your ticket to someone else, now you either have to eat a hefty change fee or lose it outright. That's money in their pockets that they didn't used to get.   It was corrected to:     Another factor--sometimes life happens and you can't fly. In the old days you could simply sell your ticket to someone else, now you either have to eat a hefty change fee or lose it outright. That's money in their pockets that they didn't use to get.    Was this grammatical correction an improvement? Was the original text grammatically correct? Is the edited text grammatically correct? Functions Which are non differentiable on a Given Set. In a bash shell script, writing a for loop that iterates over string values Diagram of an artificial neural network Why $\lim\limits_{n\to \infty}\left(1+\frac{1}{n}\right)^n$ doesn't evaluate to 1? I am trying to identify what the flaw is exactly when reasoning about a limit such as the definition of $\mathbf e$:  $$ \lim_{n\rightarrow \infty}\left(1+\frac{1}{n}\right)^n={e} $$  Now, I know there are ways of proving this limit, such as by considering the binomial expansion of $(1+\frac{1}{n})^n$ and comparing that to the Maclaurin series of $e$. So to make this clear, I am not looking for a proof of the limit definition of $e$.  I tried searching for "limit laws/rules" but none of the rules I found described the above case. Hence, I am looking for a specific rule (or perhaps a certain perspective) that will help me realize why the above does not in fact evaluate to 1.  My train of thought is as follows: at a first glance, if I wasn't already familiar with what the limit evaluates to, I probably would evaluate the expression inside the brackets first, and then apply the limit to the power. So, $$\displaystyle\lim_{n\to\infty}\frac{1}{n}=0\quad\text{and then}$$  $$\displaystyle\lim_{n\rightarrow \infty}\left(1+0\right)^n=\lim_{n\to\infty}1^n=1$$  Why is my reasoning flawed? Capture console exit C# I have a console application that contains quite a lot of threads.  There are threads that monitor certain conditions and terminate the program if they are true.  This termination can happen at any time.  I need an event that can be triggered when the program is closing so that I can cleanup all of the other threads and close all file handles and connections properly.  I'm not sure if there is one already built into the .NET framework, so I'm asking before I write my own.  I was wondering if there was an event along the lines of:  MyConsoleProgram.OnExit += CleanupBeforeExit; Geometric random variables $X_1:G(p_1)$ $X_2:G(p_2)$ $X_3:G(p_3)$ are independent, prove the following : Proof for the funky trace derivative : $d (\operatorname{trace} (ABA'C))$? Given three matrices $A$, $B$ and $C$ such that $ABA^T C$ is a square matrix, the derivative of the trace with respect to $A$ is:  $$ \nabla_A \operatorname{trace}( ABA^{T}C )  = CAB + C^T AB^T $$  There is a proof . However, I was not able to understand the second line of the proof. it says something like this:  $$ \nabla_A \operatorname{trace}( ABA^T C )= \nabla_\bullet \operatorname{trace}(f(\bullet)A^{T}C) + \nabla_\bullet \operatorname{trace}(f(A) \bullet^T C) $$  Where  $f(A) = AB$  I tried searching the proof or any hint using google, but I couldn't fine anything. Could anyone please help me with this second line. I cannot sleep. I am obsessed with this proof. I have installed Ubuntu on, but now I am trying to install NVIDIA CUDA Toolkit for the GPU. When I install it, it says that there is no driver found, so I have tried to install the driver, but I don't know why after installation, the system not coming up. Maybe it is because of the wrong version of the driver.   When I tried to detect the driver version using sudo lshw -C display , it showed this information:    But here it doesn't say that what is the product name of the driver, and also when I go Software &amp; Updates -> Additional Drivers, then it says NVIDIA Corporation: Unknown.    What should I do? The indefinite article "an" is used when the following word starts with a vowel sound. For example one write "an adjective" but "a noun".   However, when an abbreviation is used, should this be based on the expanded meaning, or on the letters of the abbreviation.  Specifically, one writes "a noun phrase". However, here on ell.se, the abbreviation "NP" for 'noun phrase" is commonly used. If this were pronounced by sounding out its letters, as "En-Pee" it would call for "an". If it were read as "noun phrase"  it would call for "a". Should one write "a NP" or "an NP" here on ELL?  I incline to "a NP" and i used that in  just a few minutes ago, but I am not at all sure. Does there exist an $a_0$ such that the sequence $a_{n+1} = 2a_n + 1$ is prime for all $n \ge 0$? I believe I see that $a_n = 2^n(a_0+1) - 1$ but am somewhat uncertain where to proceed afterwards. I am a complete beginner at number theory and would appreciate it if someone could point me in the right direction--surely there is some obvious argument I am missing. Connect two computers with SSH in a home LAN I have two ubuntu computer shared the same wifi and desire to reach another from one's terminal.  First create an user on the second computer named "Second" and hostname "Algorithms"    Then tried to reach it from the other with SSH,  but get error report as   $ ssh second@Algorithms   ssh: Could not resolve hostname algorithms: nodename nor servname provided, or not known   The solution I tried is based on   What's the problem with my experiment? Bounded sequence with divergent Cesaro means Is there a bounded real-valued sequence with divergent Cesaro means (i.e. not Cesaro summable)?  More specifically, is there a bounded sequence $\{w_k\}\in l^\infty$ such that $$\lim_{M\rightarrow\infty} \frac{\sum_{k=1}^M w_k}{M}$$ does not exist?  I encountered this problem while studying the limit of average payoffs criterion for ranking payoff sequences in infinitely repeated games.