I am using my Google Spreadsheet to keep tabs of my incoming and outgoing money. I've made a row with ~19 cells in it, in those 19 cells I have the monthly what comes in and what goes out. At the end I add this all up and then subtract a different cell that adds up random costs.  But my problem here is that the calculation =SUM(C4:C17) counts everything, even the money that has not come in or that was spend. But I don't want to fiddle around with that calculation all the time.  Is it possible to make every cell in row C red and when it's red it does not count (so it will be ignored) but if I make the cell green it gets added in the grand total?
I have seen  and altough I face the same problem, the answer to that question is not helpful to my case.   I have large spreadsheets which are changed frequently. So, according to the solution accepted to that question, it is hard to duplicate all populated columns and it is cumbersome to edit one more cell everytime I wish to make a change on cells background colors.  Isn't there a way to sum data based on a condition regarding cell background color in Google Spreadsheets?
Jointly Complete Sufficient Statistics: Uniform(a, b) Let $\mathbf{X}= (x_1, x_2, \dots x_n)$ be a random sample from the uniform distribution on $(a,b)$, where $a &lt; b$.   Let $Y_1$ and $Y_n$ be the largest and smallest order statistics.  Show that the statistic $(Y_1, Y_n)$ is a jointly complete sufficient statistic for the parameter $\theta  = (a, b)$.     It is no problem for me to show sufficiency using factorization.   Question: How do I show completeness? Preferably I would like a hint.    Attempt: I can show $\mathbb E[g(T(x))] = 0$ implies $g(T(x)) = 0$ for the one parameter uniform distribution, but I am getting stuck on the two parameter uniform distribution.   I tried playing around with $\mathbb E[g(Y_1, Y_n)]$ and using the joint distribution of $Y_1$ and $Y_n$, but I am not sure if I am going in the correct direction, as the calculus is tripping me up. Gradient steepest direction and normal to surface? From this , I now understand the gradient to be the directional derivative that returns the steepest slope at a point. However, reading my textbooks, they all say that the gradient is normal to the tangent plane. In the above SE question, the gradient sounds like it should be parallel to a direction in the $xy$ plane, not actually up on the surface.   My question is therefore do I have a misunderstanding of the tangent plane, gradient or directional derivative?   In addition, I question how the gradient always passes through the origin or the $xy$ plane? If for instance in the graphic, the gradient had been another direction (say horizontal), then it wouldn't pass through the origin! In addition, the gradient of other points in the graphic would satisfy this example. Many thanks! HTML element does not fade in using jquery I accidentally set an object as camera, how do I undo this? I came to Netherlands from Dubai on a business visa. Now I wish to travel to Paris by train and after two days wish to leave to Dubai direct from Paris. Am I allowed to exit Paris to Dubai when the entry stamp in my passport is Amsterdam? Can I manually put an external hard disk to sleep? I have a Dedicated Bedrock Server running on my PC, and I can't connect from the same PC where the server is. If I add it onto the list of servers, it appears as "Locating server" and never finds it.    If I try to connect, I get "Unable to connect to world".    On my friend's PS4, it appears on the Friends tab as a LAN Game on a Dedicated Server.    And also on my sister's laptop. We are using following code in .php script for generate .pdf file.  $result1 = exec("R CMD Sweave /var/www/html/r/r_latex_sweave.Rnw");  $result2 = exec("pdflatex /var/www/html/r/r_latex_sweave.tex");   but, we are getting this errors when we are executing .Rnw and .tex files.  ! I can't write on file `r_latex_sweave.log'. Please type another transcript file name:  ! Emergency stop !  ==> Fatal error occurred, no output PDF file produced!  Note: We have .tex and .Rnw folder in /var/www/html folder? Continuous function on R which tends to infinity on open interval must have a minimum Suppose we have $f : \mathbb{R} \to \mathbb{R}$ continuous and $$\lim\limits_{x \to \pm \infty} f(x) = \infty.$$  Then must $f$ have a minimum on $\mathbb{R}$?  Intuitively it seems so, and it's easy to prove for some arbitrary closed interval in $\mathbb{R}$ with the Extreme Value Theorem, but how can we apply that to an open interval like $(-\infty, \infty)$? Shifting -5 V to +5 V signal to 0 to +5 V for ADC I want to convert the  output voltage of an ECG (-5 to +5) to 0 - +5 volt for ADC. Should i use Op amp ? What is my problem in this picture? I simulated it in Proteus ... but when input voltage is higher than 4 V or lower than -4 V Vout gives an unexpected value.   Below is another simulink that have same problem ...    My idea to make this level of voltage is (Vin +10)/2 that give the range 0-5 V. Get output parameter value in ADO.NET What should I do when flagging if I don't see the destination site in the list? Sometimes I want to flag a question on Stack Overflow because it belongs to  or , but I don't see those sites on the list provided when you click on:  It doesn't belong here > off topic  I usually see: What's the difference between a projection and a datum? How can I secure an Ethernet-over-power network? I just bought myself an Ethernet-over-power adapter, and plugged it in. It seems to be working great, but now I'm concerned that my neighbours may be able to access my network.  I live in a rowhome complex; is it possible they can access my network? If so, how can I secure it? Suppose $A$ and $B$ are similar matrices. Show that $A$ and $B$ have the same eigenvalues with the same geometric multiplicities.      Similar matrices: Suppose $A$ and $B$ are $n\times n$ matrices over $\mathbb R$ or $\mathbb C$. We say $A$ and $B$ are similar, or that $A$ is similar to $B$, if there exists a matrix $P$ such that $B = P^{-1}AP$. Show that if $n$ is not divisible by $2$ or by $3$, then $n^2-1$ is divisible by $24$.   I thought I would do the following ... As $n$ is not divisible by $2$ and $3$ then $$n=2k+1\;\text{or}\\n=3k+1\;\text{or}\\n=3k+2\;\;\;\;$$for some $n\in\mathbb{N}$. And then make induction over $k$ in each case.$$24\mid (2k+1)^2-1\;\text{or}\\24\mid (3k+1)^2-1\;\text{or}\\24\mid (3k+2)^2-1\;\;\;\;$$This question is in a text of Euclidean Division I'm reviewing, and I wonder if there is a simpler, faster, or direct this way. Prove the divisibility test by $7,11,13$ for numbers more than six digits The PS3 version of Portal 2 comes with a code to link it to a Steam account. Apparently this allows you to play on both the PC and PS3 with one purchase.  Can this be used to play co-op between the two platforms? What is the difference between conditioning on regressors vs. treating them as fixed? How can I list installed packages by installation date?  I need to do this on debian/ubuntu. Answers for other distributions would be nice as well.  I installed a lot of stuff to compile a certain piece of code, and I want to get a list of the packages that I had to install.