C# - How to embed DLL into the project?
Embedding DLLs in a compiled executable
How do you delete all the cookies for the current domain using JavaScript? A Product function for matrix products I need help with this:  If a is an element of $\mathbb Z_n$ and $\gcd(a,n) &gt; 1$ , then a is not invertible.   First you show that if $a$ is an element of $\mathbb Z_n$ and $\gcd(a,n)&gt;1$, then there  is an element $b$ of $\mathbb Z_n$ and ($b$ is not equal to the zero element) from which $ab = 0$.   The second part I cant get. i.e. show if $b$ is not the zero element  and $ab=0$ then $a$ is not invertible. How do I completely remove Ubuntu 12.04 on my Mac? I have dual booted Ubuntu 12.04 on my Mac using disk utility and the rEFIt tool.The battery life is very bad and therefore I want to switch back to Ubuntu 10.04 . How can I completely remove the 12.04 partition? Why are integer GCDs positive? [unit normalization of GCDs] The definition in my text reads, An integer $d$ is said to be the greatest common divisor of two non-zero integers $a$ and $b$ iff,  $d|a$ and $d|b$ and if $k$ is any other common divisor of $a$ and $b$ then $k|d$  Now here's the thing, if $d|a$ and $d|b$ then surely $-d|a$ and $-d|b$ as well, also $k|-d$ What I take from this? GCD is not unique! That is if $\mathrm{gcd}(12,8)= 4$ then by the definition, $\mathrm{gcd}(12,8) = -4$ as well. Yet I never ever seen a negative gcd. Someone please explain. Maybe, $4&gt;-4$, and we want the &quot;greatest common factor&quot; so...? But that still doesn't justify the definition. How to use exclamation marks in Minecraft commands? I know that you can use exclamation marks in Minecraft commands to check for an entity that does not have a specific tag. For example, you can use /kill @e[type=!Player] to kill all entities except for the player. I have, however, encountered two problems with using exclamation marks that I can't find a solution for.  For my first problem, I've set up a series of command blocks to summon shootable fireballs above the player’s head when a certain item is being held;  /scoreboard players add @a Fireball 1 {SelectedItem:{tag:{display:{Name:"Summon Fireball"}}}} /execute @a[score_Fireball_min=1,score_Fireball=1] ~ ~ ~ /summon Fireball ~ ~2.5 ~ {direction:[0.0,0.0,0.0]} /scoreboard players set @a Fireball 0   I used a comparator and a redstone torch so that the last command would activate when the first command would deactivate, that is, when the player is not holding the item.  The problem is, that when I move far away from the setup, the redstone stops working, leaving me unable to summon any new fireballs. Instead, I'm trying to use a command block to check when anything except for item is being held;  /scoreboard players set @a Fireball 0 {SelectedItem:{tag:{display:{Name:!"Summon Fireball"}}}}   I’ve either put it at the wrong place, or you simply can’t use exclamation marks in NBT tags. Could someone tell me where I should put the exclamation mark, or in the latter case, how I can check for anything except for a specific item?  Further, I’ve tried using exclamation marks to set the score of all entities, including the ones with a blank score, but except for the ones with a score of 2 or higher, to 0;  /scoreboard players set @e[score_arrows_min!=2] Arrows 0 /scoreboard players set @a Arrows 1 {SelectedItem:{tag:{display:{Name:"Rain of Arrows"}}}} /scoreboard players set @e[type=Arrow] Arrows 2 {inGround:1b}   The code does change the scores of entities without scores to 0, but it doesn’t exclude the arrows with a score of 2. Could anyone tell me what I’m doing wrong here? I have an excel file with 2 attribute columns, 1-feature info 2-Number of color (RGB) that the current feature should be symbolize. This file file can be joined with the layer using the "feature info" field which is unique (join by attribute table). So i have as attribute the color number attribute for every polygon feature.  How can  i use this this information to symbolize every feature with their attributed color already imported from the excel sheet? Proving that two vector spaces of equal dimension are isomorphic Given the following problem     Let $U$ and $V$ be finite dimensional vector spaces, such that $\dim(U) = \dim(V)$. Prove that $U$ and $V$ are isomorphic.   I was just wondering if somebody could critique and validate my proof.  Proof  Two vector spaces $U$ and $V$ are isomorphic if and only if there exists a bijection $\phi: U \to V$. That is, an invertible linear map between the two. Let $\dim(U) = \dim(V) = n$ and let $\left\{u_1, \dots, u_n\right\}$ and $\left\{v_1, \dots, v_n\right\}$ be bases for $U$ and $V$, respectively. It follows that any vector $u \in U$ can be written as  $$ u = c_1u_1 + \cdots + c_nu_n $$  We define $\phi: U \to V$ as  $$ \phi(c_1u_1 + \cdots + c_nu_n) = c_1v_1 + \cdots + c_nv_n $$  Observe that $\phi$ is invertible. That is, given a vector  $$ v = d_1v_1 + \cdots + d_nv_n $$  in $V$, we define $\phi^{-1}: V \to U$ as  $$ \phi^{-1}(d_1v_1 + \cdots + d_nv_n) = d_1u_1 + \cdots + d_nu_n $$  Since there exists a bijection between $U$ and $V$, they are isomorphic. A non-trivial normal subgroup N of a finite group G or order $p^n$ is such that $N\cap Z(G)\neq \{ 1\}$ Let $N\neq 1$ be a normal subgroup of G, where G has order $p^n$, $p$ prime, $n\geq 1$.  I need to show that $Z(G)\cap N\neq \{1\}$.  I have tried to do it this way: Suppose $|N|=p^m$, $m&lt;n$. Since $N\cap Z(G)$ is normal in $Z(G)$, in both cases ($N\cap Z(G)=\{1\}$ and $N\cap Z(G)\neq\{ 1\}$), I used the Second Group Isomorphisms Theorem to get:  $G/N\cong Z(G)/N\cap Z(G)$  so $|G/N| = |Z(G)/N\cap Z(G)|$  Since N is normal in G, $|G/N|=p^{n-m}$, with $n-m&gt;0$. So $|Z(G)/N|\cap Z(G)|=p^{n-m}\Rightarrow [Z(G):N\cap Z(G) ]=p^{n-m}$  and this means that $N\cap Z(G)\neq \{1\}$. Getting "Not found" message when running a 32-bit binary on a 64-bit system I have currently a strange problem on debian (wheezy/amd64).  I have created a chroot to install a server (i can't give any more detail about it, sorry). Let's call its path /chr_path/. To make things easy, I have initialized this chroot with a debootstrap (also wheezy/amd64).  All seemed to work well inside the chroot but when I started the installer script of my server I got : zsh: Not found /some_path/perl (the installer includes a perl binary for some reasons)  Naturally, I checked the /some_path/ location and I found the "perl" binary. file in chroot environment returns :  /some_path/perl ELF 32-bit LSB executable, Intel 80386, version 1 (SYSV), dynamically linked (uses shared libs), for GNU/Linux 2.2.5, not stripped   The file exists, seems ok, has correct rights. I can use file, ls, vim on it but as soon as I try to execute it - ./perl for example - I get : zsh: Not found ./perl.  This situation is quite understandable for me. Moreover :   I can execute other basic binaries (/bin/ls,...) in the chroot without getting errors I have the same problems for other binaries that came with the project When I try to execute the binary from the main root (/chr_path/some_path/perl), it works. I have tried to put one of the binaries with a copy of my ls. I checked that the access rights were the same but this didn't change anything (one was working, and the other wasn't) How do I dynamically invoke a class method in PHP? How can I dynamically invoke a class method in PHP? The class method is not static. It appears that   call_user_func(...)   only works with static functions?  Thanks. What is the procedure for taking down Titans? I need to find the values of $a$ and $n$ in the following  $$ (1 + ax)^n  = \sum_{i=0}^\infty \binom{2i}{i}x^i$$  How can I compare things and show that $a=-4$ and $n = -{1 \over 2}$. It's easy to expand $1 \over \sqrt{1 -4x}$ see that it's valid but I'm looking other way around. Is there a standard naming convention for XML elements? Is there any standard, de facto or otherwise, for XML documents? For example which is the "best" way to write a tag?  &lt;MyTag /&gt; &lt;myTag /&gt; &lt;mytag /&gt; &lt;my-tag /&gt; &lt;my_tag /&gt;   Likewise if I have an enumerated value for an attribute which is better  &lt;myTag attribute="value one"/&gt; &lt;myTag attribute="ValueOne"/&gt; &lt;myTag attribute="value-one"/&gt; Prove that there exists some $c\in(-3,3)$ such that$ \ \ g(c) \cdot g''(c)<0$. $f(x)$ is a differentiable function and $g(x)$ is a double differentiable function such that $|f(x)|\leqslant 1$ and $f'(x)=g(x)$. If $$f(0)^2+g(0)^2=9$$ then prove that there exists some $c\in(-3,3)$ such that$ \ \ g(c) \cdot g''(c)&lt;0$.  Attempt: Let us define a function $h(x) = g(x) g~'(x)$. Then $$h'(x) =  g(x)g''(x) + \left( g'(x) \right)^2 \tag 1$$ If we prove that for some $c \in (-3,3), h~'(c) &lt; 0,$ then $$g(c)g''(c) &lt;0 \tag 2$$ Also, $$\left|f(0)\right| &lt; 1 \implies f'(0) \in (-3,-2\sqrt 2 ) \cup (2\sqrt 2,3) $$ Could someone please advise me how do I move forward from here. Thank you very much for your help in this regard. Is there a way to insert Keyboard Glyphs in Google Docs? Here on the StackExchange framework we have a nice feature, which is apparently called "Keyboard Glyphs" (cf. ):     CTRL+Z   Is there a way (e.g. with an Add-On) to do the same in Google Docs? I browsed the Add-Ons but did not find anything, maybe it's hidden somewhere different (e.g. in a Code Formatting Plugin). Which statistical test to analyse? I am trying to find out how inflammatory markers change in response to a mechanical device change. I have daily readings for the 5 days before the event and for the 5 days after the event. I am expecting a rise in inflammatory markers in the pre readings followed by a fall after the device change. I also need to find out how the change differs in two subgroups (sample sizes of the subgroups are n=21 and n=88). The aim is to find out if the change is significant, to consider these markers as predictors of the device failing and hence needing to be changed.    I would like to know what test would be appropriate to analyse this. I need to keep things simple as I and the people reading the results are non-statisticians. How does the twitter bot work? I heard that there was a twitter bot which automatically posted questions and asked for answers for specific questions on every site. How do they work? Is there an algorithm for doing this or is it purely random? I know that it doesn't tweet closed questions, but that's it. Run Script on Wakeup? Error while running Quickly