Why can't write 4Gb file onto flash drive with 10Gb free?
Why can't I copy a 7 GB file to an external USB HD with 120 GB free?
Turning off auto-maximizing of windows in 14.04 I know this has been asked for other Ubuntu releases, but the solutions posted are not working for me in 14.04. I've installed CCSM and turned off the grid option, but the windows still maximize when dragging to the top of the screen. I've dealt with it for a while but it's getting rather obnoxious. Anyone else had this problem and come across a solution?  EDIT:  This is happening in Gnome Classic, but not Gnome 3 Usage and origin of "sister" in expressions like "sister company, sister ship, sister site" etc Question: For every polynomial $P(x)$ of degree at n we have $$\sum_{i=0}^{n+1}(-1)^i\binom{n+1}{i}P(i)=0$$  Well I was inducting on degree of the polynomial, for $n=0$ its true and I got a bit confused in the inductive step, actually I cant figure the inductive step.   Is this property (if true) a famous one?  Thank you for your help. Read Gif Images using WebView android I have a very big file 4GB and when I try to read it my computer hangs. So I want to read it piece by piece and after processing each piece store the processed piece into another file and read next piece.  Is there any method to yield these pieces ?  I would love to have a lazy method. I have fought the pumpkin moon and died like 3 times and made it to wave 7 or 6 whenever the pumpking first appears. I have full turtle armor and my primary melee weapon is a demon sickle. I also have the possessed hatchet, magnet sphere, and sniper rifle. I also have other gear like the Uzi. What should I replace, what should I take out, and what should I add? Thanks! How do I run wireshark, with root-privileges? A standard installation of Wireshark doesn't give the program permission to access the network interface.   I suppose I have to run the program with sudo, but do not know how to add it to the icon - if that's the way to do it. This is trigonometry from double angles and compound angles. Thus far I've simplified it up to this point. $$2 \sin^2θ – 3\sinθ +1 = 0$$  I'm trying to factorize this to solve for General Solution. I tried taking out a common but that +1 is giving me a problem. I used the quadratic equation to get 1 and 0.5 as an answer, but i don't know how to write it in terms of 2sin(squared)θ and -3sinθ.  Any help will be appreciated. (I'm going to link to this Stackexchange post concerning Nullary Operations: )  In general an  is a function $f:S^n \to S$, where $n$ denotes the arity of the operation, and a  is a function $f:S^0 \to S$.  It is clear that $S^n=S \times S \times \cdots \times S$ denotes the Cartesian product of a set with itself ($n$ times), however $S^0$ makes little sense to me.  One might define $S^0=\emptyset$. At first glance, that seems like a good choice. However then a nullary operation makes no sense, since it must be a function $f: A \to B$ where $A$ and $B$ are two sets representing the domain and codomain of the function. And note a function is defined in terms of relation, where a relation is a subset of the Cartesian product $A \times B$. So when we think of $A=S^0=\emptyset$ and $B=S$, so that we have a nullary operation $f:\emptyset \to S$, what is a a subset of $\emptyset \times S$? What even is $\emptyset \times S$? By definition of the Cartesian product, \begin{equation} \emptyset \times S = \{(a,b):a \in \emptyset\textrm{ and }b \in S\}. \end{equation} But there exists no $a \in \emptyset$! Therefore there exist no ordered pairs in our Cartesian product! Therefore $\emptyset \times S = \emptyset !$. Remember a function is a relation which is a subset of the Cartesian product. Therefore our relation is the empty set, and therefore also $f=\emptyset$.    Edit: We got the definition sorted out in the comments. Thanks especially to Hayden and Christoff for their great help. In summary, we figured out that $S^0=\{()\}$, the set containing only one element, the "empty $n$-tuple". Then if taking $S=\{1,2,...,k\}$, then a nullary operation $f:S^0 \to S$ is a function, i.e. some subset of $S^0 \times S = \{()\} \times S$. Looking at $\{()\} \times S$, this equals $\{((),1),((),2),...,((),k)\}$. Then a function is a special subset of this, so that each element of the domain (and there is only one element, namely $()$) is paired with exactly one element of the codomain. Therefore a function would have the form $f=\{((),a)\}$ where $a$ is one of $1,2,...,k$. Thank you for your help. How should I successfully hibernate Ubuntu 16.04?  I've tried almost every solution on the web but non of them was actually helpful. I found my problem almost completely similar to Understanding of the theorem that all norms are equivalent in finite dimensional vector spaces I'm trying to prove commutativity of addition for vector spaces, using the axioms for vector spaces. Apparently commutativity can be proven! Im having trouble getting a good feel for what is allowed and what is not. Here's my work so far:  $u+v+u+v = 2(u+v) = 2u + 2v = u+u+v+v = u+(u+v)+v$  Here I just wanna claim that $u+(v+u)+v = u+(u+v)+v$   $\Rightarrow -u+u+(v+u)+v+(-v) = -u+u+(u+v)+v+(-v)$ : here im just adding -u to the right, and -v to the left. Question: is this "adding to both sides" really legit in this context? Why?   Quick help proof: $-v+v = (-1)v+(1)v = (-1+1)v = 0v = 0 = v-v$  And another: $ 0+v = v+(-v) + v = (1)v + (-1)v + v = (1-1)v + v = v = v+0$  We have $0 + (u+v) + 0 = 0+(v+u)+0 \Rightarrow u+v = v+u$  This feels ugly and not at all elegant, especially the great leap "add -u to both sides" feels completely out of place. Do I need more lemmas? Is there a more elegant way?   //not homework or anything, just for my own pleasure, feel free to provide theory, as it is more insightful than solutions. :) Thanks!   EDIT: corrected notation a little. Is there any objective benefit to escape sequences over tput? In people's '.*rc' files I see online or in various code, I tend to see a lot of people who manually use ANSI escape sequences instead of using tput.  I had the understanding that tput is more universal/safe, so this makes me wonder:  Is there any objective reason one should use escape sequences in place of tput?  (Portability, robustness on errors, unusual terminals...?) Get the generated SQL statement from a SqlCommand object? I have the following code:  Using cmd As SqlCommand = Connection.CreateCommand     cmd.CommandText = "UPDATE someTable SET Value = @Value"     cmd.CommandText &amp;= " WHERE Id = @Id"     cmd.Parameters.AddWithValue("@Id", 1234)     cmd.Parameters.AddWithValue("@Value", "myValue")     cmd.ExecuteNonQuery End Using   I wonder if there is any way to get the final SQL statment as a String, which should look like this:  UPDATE someTable SET Value = "myValue" WHERE Id = 1234   If anyone wonders why I would do this:   for logging (failed) statements for having the possibility to copy &amp; paste it to the Enterprise Manager for testing purposes Proposing Windows as its own Stack Exchange site? Is there a reason why we have a "Unix and Linux" Stack Exchange and an "Apple" Stack Exchange but no "Windows" Stack Exchange? (Hell even Ubuntu got its own)  I couldn't find it anywhere so I'm asking.  Since Windows has many users it would be a potent Stack Exchange. When I use the -a option as is asked and answered in , I got a lot of "rsync: failed to set permissions on" errors.  rsync: failed to set permissions on "/ata/text/RCS/jvlc,v": Operation not permitted (1) rsync: failed to set permissions on "/ata/text/RCS/jvm,v": Operation not permitted (1) rsync: failed to set permissions on ...   Why is this? The files are normal files with permission of 0664. One-sided limits of $f'(x)$ at a point vs. one-sided limits of the difference quotient at that point I know that if a function is piecewise, then when differentiating it one needs to deal separately with the points of intersection of the pieces, because the derivative may not be defined there.  Also, if a one-sided limit of $f'(x)$ at these "crucial points" is infinite or doesn't exist, it doesn't preclude the limit of the difference quotient from existing and being finite. For example, take $f(x)=x^2\sin\frac1x, f(0)=0$: $f'(x)= 2x\sin\frac1x-\sin\frac1x $ has no limit as $x\to0$ but $\lim\limits_{h\to0}\frac{f(h)-f(0)}{h}=0=f'(0)$.  On the contrary, looking at $f(x)=\sin x +\lvert \sin x\rvert $ on $[0,2\pi]$ one has $f'(x)=2\cos x$ on $(0,\pi) $ and $f'(x)=0$ on $(\pi,2\pi)$ so $\lim\limits_{h\to0^+}f'(\pi+h)\ne\lim\limits_{h\to0^-}f'(\pi+h)$, but they are both finite. And in this case it's easy to find that they agree with the one-sided limits of the difference quotient. Why? Does the finiteness of the former imply that they agree with the latter? Is this also true if the one-sided limits of $f'$ at the crucial points agree with each other? We have some new hardware in our office which runs its own customized Linux OS.   How do I go about figuring which distro it's based on? Exploring $ \sum_{n=0}^\infty \frac{n^p}{n!} = B_pe$, particularly $p = 2$. I was exploring the fact that $$ \sum_{n=0}^\infty \frac{n^p}{n!} = B_pe,$$ where $B_n$ is the $n$th Bell number.   I found this result by exploring the series on wolframalpha and looking up the sequence of numbers generated. I have no experience with Bell numbers other than knowing that they represent the number of ways of partitioning a set.   What I tried  Looking at the base case we can verify $$\sum_{n=0}^\infty \frac{n}{n!} = \sum_{n=1}^\infty \frac{1}{(n-1)!} = e. $$  But then I realize that $n^2$ is going to be difficult.  Specifically what I want  I am doing this for fun, so I just want to glean some sort of lesson out of this. Resources that let me learn for myself are just as good!   An accepted answer will have any one of the following:   A proof that $\sum_{n = 0}^{\infty} \frac{n^2}{n!} = 2e$ (this interests me a lot) A description of why this series is related to Bell numbers and the number of partitions of a set A link to some resource that introduces Bell numbers and/or their connection to this series. extract lines that match a list of words in another file I have file 1 which have those lines:  ATM 1434.972183 BMPR2 10762.78192 BMPR2 10762.78192 BMPR2 1469.14535 BMPR2 1469.14535 BMPR2 1738.479639 BMS1 4907.841667 BMS1 4907.841667 BMS1 880.4532628 BMS1 880.4532628 BMS1P17 1249.75 BMS1P17 1249.75 BMS1P17 1606.821429 BMS1P17 1606.821429 BMS1P17 1666.333333 BMS1P17 1666.333333 BMS1P17 2108.460317 BMS1P17 2108   And file 2 have a list of words:  ATM BMS1   So, the output will be like this:  ATM 1434.972183 BMS1 4907.841667 BMS1 4907.841667 BMS1 880.4532628 BMS1 880.4532628   I know it's really a duplicate question, but I tried all types of grep and sed and awk, maybe it will works with you guys with this tiny example  but I have a very huge file &gt; 1M lines and all previous way doesn't help  it return part of the lines that containing those words although there are other words in file 2 that matches the lines from file 1