As the title says. I am getting a lot of dropped sandstone that I would like to get killed, but I also have bamboo and minecarts that I don't want getting deleted. Is there any way to do this using command blocks? The /fill command will not work for me, as I need dropped items killed, not placed items.
I've got a capture the flag arena. One issue we keep running into during play, is that of clutter.  We have /gamerule keepInventory false, so the pitch gets rather cluttered with armor, weapons and building materials, such that it becomes difficult to pick the flag up, due to full inventories.  I've discovered the following command to remove all drops from the arena:  /kill @e[type=Item]   However, this removes all the floating items from the ground. I'd like, if possible, to preserve the flag from being destroyed.  I have this command for detecting the flag:  /testfor @e[type=Item,x=40,y=1,z=40,dx=40,dy=27,dz=80] {Item:{id:"minecraft:banner",Damage:4s}}   But I'm not sure how to combine the two in a way that it will destroy everything except for the flag.  Any ideas?
In Visual Studio, I can cycle through my clipboard history by pressing CTRL+SHIFT+V rather than CTRL+V. I believe it's called a clipboard ring. But that feature doesn't seem to exist outside of Visual Studio, at least not with the same key combination. Is there a key stroke combination built in to windows to do the same, i.e. be able to cycle through your clipboard history while pasting? Code block is not properly formatted when placed immediately after a list item How to draw open-close interval in LaTeX I am using the following commands to have half-open interval in a real line:   \begin{tikzpicture}[scale=7] \draw[-&gt;, thick] (-0.1,0) -- (1.7,0); \foreach \x/\xtext in {0/8,0.2/$S_1$,0.4/$T_4$,0.6/$S_3$,0.8/$T_2$,1/$S_3$,1.2/14,1.4/$S_3$,1.6/16}     \draw[thick] (\x,0.5pt) -- (\x,-0.5pt) node[below] {\xtext}; \draw (0.2,0.5pt) node[above] {$c$}; \draw[[-), ultra thick, blue] (0.2,.01) -- (.4,0.01); \draw[(-, ultra thick, green] (0.6,.02) -- (1,0.02); \end{tikzpicture}   Now, I need to have an open-close interval, but I am not able to have that close interval at the end, using the following command:  \begin{tikzpicture}[scale=7] \draw[-&gt;, thick] (-0.1,0) -- (1.7,0); \foreach \x/\xtext in {0/8,0.2/$S_1$,0.4/$T_4$,0.6/$S_3$,0.8/$T_2$,1/$S_3$,1.2/14,1.4/$S_3$,1.6/16}     \draw[thick] (\x,0.5pt) -- (\x,-0.5pt) node[below] {\xtext}; \draw (0.2,0.5pt) node[above] {$c$}; \draw[(-], ultra thick, green] (0.6,.02) -- (1,0.02); \end{tikzpicture}   May I ask for anybody help? Why are site stats graph for beta sites not available to public? Currently, on all beta sites, the current site stats is placed prominently on the front page, which is great for knowing how the site is currently doing.  However, it doesn't say anything about the trend of the numbers - whether the site is sailing or it is sinking compared to the last month. According to Madara Uchiha, our moderator on Anime &amp; Manga SE, . Disregarding data which are not already public, , I can't see any reason why we are not allowed access to graphical representation of public site statistics. In fact, there is already a third-party app that scraps the information from the home page and . Can we have a beautiful visualization on how our beta sites evolve over time, from pony to unicorn?   Images stolen borrowed from Bulbapedia How to tell whether two graphs are isomorphic? using tar showing, "No Such file or directory" But when I try to run it using  tar zxvf jre-8u151-linux-i586   I get tar (child): jre-8u151-linux-i586: Cannot open: No such file or directory tar (child): Error is not recoverable: exiting now tar: Child returned status 2  What is wrong? The name and place matches prefectly. I remember that a couple of years ago a friend showed me and some other people the following expression:  $$\lim_{n\to \infty}\frac{1^n+2^n+\cdots+(n-1)^n}{n^n}.$$  As shown below, I can prove that this limit exists by the monotone convergence theorem. I also remember that my friend gave a very dubious "proof" that the value of the limit is $\frac{1}{e-1}$. I cannot remember the details of the proof, but I am fairly certain that it made the common error of treating $n$ as a variable in some places at some times and as a constant in other places at other times. Nevertheless, numerical analysis suggests that the value my friend gave was correct, even if his methods were flawed. My question is then:  What is the value of this limit and how do we prove it rigorously?  (Also, for bonus points, What might my friend's original proof have been and what exactly was his error, if any?)  I give my convergence proof below in two parts. In both parts, I define the sequence $a_n$ by $a_n=\frac{1^n+2^n+\cdots+(n-1)^n}{n^n}$ for all integers $n\ge 2$. First, I prove that $a_n$ is bounded above by $1$. Second, I prove that $a_n$ is increasing.   (1) The sequence $a_n$ satisfies $a_n&lt;1$ for all $n\ge 2$.  Note that $a_n&lt;1$ is equivalent to $1^n+2^n+\cdots+(n-1)^n&lt;n^n$. I prove this second statement by induction. Observe that $1^2=1&lt;4=2^2$. Now suppose that $1^n+2^n+\cdots+(n-1)^n&lt;n^n$ for some integer $n\ge 2$. Then  $$1^{n+1}+2^{n+1}+\cdots+(n-1)^{n+1}+n^{n+1}\le(n-1)(1^n+2^n+\cdots+(n-1)^n)+n^{n+1}&lt;(n-1)n^n+n^{n+1}&lt;(n+1)n^n+n^{n+1}\le n^{n+1}+(n+1)n^n+\binom{n+1}{2}n^{n-1}+\cdots+1=(n+1)^{n+1}.$$  (2) The sequence $a_n$ is increasing for all $n\ge 2$.  We must first prove the following preliminary proposition. (I'm not sure if "lemma" is appropriate for this.)  (2a) For all integers $n\ge 2$ and $2\le k\le n$, $\left(\frac{k-1}{k}\right)^n\le\left(\frac{k}{k+1}\right)^{n+1}$.  We observe that $k^2-1\le kn$, so upon division by $k(k^2-1)$, we get $\frac{1}{k}\le\frac{n}{k^2-1}$. By , we may find:  $$\frac{k+1}{k}\le 1+\frac{n}{k^2-1}\le\left(1+\frac{1}{k^2-1}\right)^n=\left(\frac{k^2}{k^2-1}\right)^n.$$  A little multiplication and we arrive at $\left(\frac{k-1}{k}\right)^n\le\left(\frac{k}{k+1}\right)^{n+1}$.  We may now first apply this to see that $\left(\frac{n-1}{n}\right)^n\le\left(\frac{n}{n+1}\right)^{n+1}$. Then we suppose that for some integer $2\le k\le n$, we have $\left(\frac{k}{n}\right)^n\le\left(\frac{k+1}{n+1}\right)^{n+1}$. Then:  $$\left(\frac{k-1}{n}\right)^n=\left(\frac{k}{n}\right)^n\left(\frac{k-1}{k}\right)^n\le\left(\frac{k+1}{n+1}\right)^{n+1}\left(\frac{k}{k+1}\right)^{n+1}=\left(\frac{k}{n+1}\right)^{n+1}.$$  By backwards (finite) induction from $n$, we have that $\left(\frac{k}{n}\right)^n\le\left(\frac{k+1}{n+1}\right)^{n+1}$ for all integers $1\le k\le n$, so:  $$a_n=\left(\frac{1}{n}\right)^n+\left(\frac{2}{n}\right)^n+\cdots+\left(\frac{n-1}{n}\right)^n\le\left(\frac{2}{n+1}\right)^{n+1}+\left(\frac{3}{n+1}\right)^{n+1}+\cdots+\left(\frac{n}{n+1}\right)^{n+1}&lt;\left(\frac{1}{n+1}\right)^{n+1}+\left(\frac{2}{n+1}\right)^{n+1}+\left(\frac{3}{n+1}\right)^{n+1}+\cdots+\left(\frac{n}{n+1}\right)^{n+1}=a_{n+1}.$$  (In fact, this proves that $a_n$ is strictly increasing.) By the monotone convergence theorem, $a_n$ converges.  I should note that I am not especially well-practiced in proving these sorts of inequalities, so I may have given a significantly more complicated proof than necessary. If this is the case, feel free to explain in a comment or in your answer. I'd love to get a better grip on these inequalities in addition to finding out what the limit is.  Thanks! Usage of that: There are many reasons [that] I am confident [that] I will excel at this job I always find it hard to see when it's best to use &quot;that&quot;. Which of these sounds best?  There are many reasons I am confident I will excel at this job. There are many reasons that I am confident I will excel at this job. There are many reasons I am confident that I will excel at this job. There are many reasons that I am confident that I will excel at this job.  Are there ways of looking at this that I can apply elsewhere? Is there a completely different formulation that works better? How to sort Wrapper list? I have a wrapper class which contains a list of sobjects, i want to have th sorting on the fields of these objects in the wrapper list: The apex code is as follows:  Class jobsWrapper {     public JobSuite__Job__c job { get; set; }     public JobSuite__Job_Task__c jobTasks { get; set; }      public JobsWrapper(JobSuite__Job__c objjobs, JobSuite__Job_Task__c objjobTasks) {         // if(jobTasks== NULL){jobTasks = new List&lt;Job_Task__c&gt;();}         job = objjobs;         jobTasks = objjobTasks;      }      public JobsWrapper() {         if(jobTasks== NULL) {             jobTasks = new JobSuite__Job_Task__c();         }          if(job == NULL) {             job = new JobSuite__Job__c();         }             } }   I want to allow sorting the wrapper list by the fields in the job - like client, jobname, jobnumber etc and fields from the task object as taskname, reviseddue dateetc.  How can I do this? Please help, thanks in advance. Low Quality Posts you Have Already Flagged I just discovered that it is possible to get a post in the Low Quality Posts review queue that you have already flagged for closing, making reviewing that item impossible. Obviously, I don't want to 'Looks Good' something that I know should be closed, but at the same time I cannot 'Recommend Close' something I have already flagged leaving the only option being to skip the post.  Can the queue be changed so that it does not show posts which you have already flagged? Youtube says "This video is currently unavailable" How does ZFC describe addition? Surprisingly, the Wikipedia article on addition doesn't contain the answer. I looked  elsewhere online for it, but didn't find it.   Intuitively, the cardinal of the union of two sets seemed appealing. But that approach doesn't work, given that the union of 2 and 2 is 2. I wondered whether ordered sets might be essential to the answer.   So, how does ZFC describe addition? Remove rogue app from menu bar I have a rogue item on my menu bar from a terrible piece of printer/scanner software. I long ago removed the app, but the button for the app remains in the menu bar.   Is there any central way for me to remove an item from the menu bar? Any plist I can hack? command line trick, etc?  It's the one to the left of the Facebook icon:    (I tried holding Command and dragging it away, but it doesn't seem to respect that convention.) UK visa: unsigned application form Is there ever a time to create a user for a company? I'm wondering if there's ever a reason or time when a company should have its own user (like say, Stack Overflow), instead of users that make it up (like, Jeff Atwood).   I figure this is kind of a bad idea as someone with access to multiple accounts could upvote himself over and over.... but is there any point this is okay and/or a good idea? How to make an image center (vertically & horizontally) inside a bigger div I have a div 200 x 200 px. I want to place a 50 x 50 px image right in the middle of the div.   How can it be done?  I am able to get it centered horizontally by using text-align: center for the div. But vertical alignment is the issue.. What is the most appropriate way to configure biblatex for use with an unsupported language? Overriding public virtual functions with private functions in C++ What happened to the Yin half of Kurama? Did Naruto get both halves of Kurama after fighting Sasuke, or did the other half of Kurama die when Minato was killed? Fighting Spam - What can I do as an: Email Administrator, Domain Owner, or User? This is a  about Fighting Spam.   Also related:                    There are so many techniques and so much to know about fighting SPAM. What widely used techniques and technologies are available to Administrator, Domain Owners, and End Users to help keep the junk out of our inboxes?  We're looking for an answer that covers different tech from various angles. The accepted answer should include a variety of technologies (eg SPF/SenderID, DomainKeys/DKIM, Graylisting, DNS RBLs, Reputation Services, Filtering Software [SpamAssassin, etc]); best practices (eg mail on Port 25 should never be allowed to relay, Port 587 should be used; etc), terminology (eg, Open Relay, Backscatter, MSA/MTA/MUA, Spam/Ham), and possibly other techniques.