fill between in pgfplots changes legend font
Scaling problem with fillbetween in pgfplots
How is Cycles different from Blender Internal? How does Cycles work and how is it different from Blender Internal?  Which is better? How do I overload the square-bracket operator in C#? DataGridView, for example, lets you do this:  DataGridView dgv = ...; DataGridViewCell cell = dgv[1,5];   but for the life of me I can't find the documentation on the index/square-bracket operator.  What do they call it?  Where is it implemented?  Can it throw?  How can I do the same thing in my own classes?  ETA: Thanks for all the quick answers.  Briefly: the relevant documentation is under the "Item" property; the way to overload is by declaring a property like public object this[int x, int y]{ get{...}; set{...} }; the indexer for DataGridView does not throw, at least according to the documentation.  It doesn't mention what happens if you supply invalid coordinates.  ETA Again: OK, even though the documentation makes no mention of it (naughty Microsoft!), it turns out that the indexer for DataGridView will in fact throw an ArgumentOutOfRangeException if you supply it with invalid coordinates.  Fair warning. the following code will only make the qed not appear in the second proof. However, it it possible to make the qed symbol never appear at the end of the proofs without having to specify it locally every time?  \documentclass{article} \usepackage{amsthm} \begin{document} \begin{proof} This has the QED symbol. \end{proof} \begin{proof}\renewcommand{\qedsymbol}{} This hasn't. \end{proof} \begin{proof} And this has it again. \end{proof} \end{document} Spam iCloud Calendar Invitations Show that $\mathbb{Z}/n^2\mathbb{Z}$ is not isomorphic to other group I'm currently working on a proof, but didn't get the right idea, a hint would be appreciated:  Show that $\mathbb{Z}/n^2\mathbb{Z}$ is not isomorphic to $\mathbb{Z}/n \times \mathbb{Z}/n$  So, lets assume there is an isomorphism between these groups, my first idea to was to construct a contradiction with the homomorphism property. But I don't know how, there should be an element in  $\mathbb{Z}/n \times \mathbb{Z}/n$ which is not in $\mathbb{Z}/n^2$ to reach this kind of contradiction. Of course there is $n \in \mathbb{Z}/n^2$ which is not in the other group but I don't know if this helps.  Thanks Image uploader shouldn't remove unused link references Filling NoData gaps in raster using ArcGIS Desktop? Has user testing found that the "three horizontal bars" for main menu on mobile is commonly understood? Why do we need a waveguide in a microwave oven? Why do we need a waveguide to move microwave power from the magnetron to the microwave cavity? Can't we just push magnetron antenna into the cavity? Why does it have to go through a waveguide? Concatenate table without header I would like to concatenate several tables and just keeping the header in the first line (and thus not having a new header each time that a new table has been concatenate). Does anyone know how to do that?  I am currently using:  find "/dir/folder" name "*.dat" -exec cat {} + &gt;&gt; "/dir/folder/table.txt"   but I can get rid of the header with that. Find the greatest value of $a^2\cdot b^3$ where $a+b=10$ Find the greatest value of $a^2\cdot b^3$ where $a,b$ are positive real numbers satisfying $a+b=10$. Determine the values of $a,b$ for which the greatest value is attained.  At first I tried to find the value by putting $a=10-b$, I found a expression, but I got not way to do anything.   If we apply A.M-G.M. inequality, I think we found the minimum value or something else. It is a pre-Olympiad level problem. So I need some answers or some good hints. How does the summoning ability affect the encounter difficulty? The Drow Mage (CR 7) has the Action Summon Demon (1/day), which allows him to summon a shadow demon (CR 4). Is the shadow demon already included in the CR of the Drow Mage, or do I have to count the shadow demon as an extra creature to determine the difficulty of the encounter? What constitutes an observation/measurement in QM? For every $g\in G$ there exists an $h\in G$ such that $g = h^3$ Let G be a finite group whose order is not divisible by $3$. Show that for every $g\in G$ there exists an $h\in G$ such that $g = h^3$. iPhone 4 passcode lock disabled and no access to iTunes How to show to the user a progression in a script? "My wife and I's seafood collaboration dinner" How to completely disable Siri on Sierra? What are some good ways to showcase someone's portfolio work online? In System Info in 11.10, the graphics driver wasn't detected. I use ACER Aspire 4750 with Intel Core i3-2340M and Intel HD Graphics 3000 graphic card  How to install the driver for my Ubuntu?