What does the expression "Word." mean?
What are the meaning and possible origin of "word!" and "word up"?
Kendo Grid & Rich text Editor of Sharepoint 2013 Ban "What have you tried?" links in comments Recently on SO, I've been noticing a lot of link-only comments on (admittedly bad) questions.  The typical comment looks like this:        Now, my first instinct is to flag the comment as "not constructive" or "too chatty", but the fact is that the blog post linked to is actually good advice.  On the whole though, the way it is being wielded like a blunt instrument comes across as—at best—lazy arrogance in my opinion and is not adding anything to the network.  Can we ban "What have you tried?" links like we did with ?  An example:    To be clear, I'm not proposing that we stop people asking for clarification or expecting askers to explain themselves properly. I just don't think comments like these are particularly constructive. Reverse String order How do I disable this:    after taking screenshot? Blog Overflow database error system of ode with non-constant coefficient matrix Capturing screenshots on the Mac has gotten very slow recently.  It used to be nearly instantaneous but now it is taking more than 10 seconds for the image to appear on the desktop.  I seem to recall having this problem years ago. The workaround was to delete a large accumulation of log files that the os had built up. After I deleted these log files, the screen capture worked very fast again.  Problem is that I cannot remember where these log files are. Searched for quite some time and could not find the information. What's the fastest way to find mineshafts? , and one place I'm fairly sure I can find them is a mineshaft.  Which leaves me back at square one, how do I find a mine shaft?  It seems they were made substantially harder to find between 1.8 and 1.0.  What's the fastest way to find a mineshaft? Proof that a sequence of continuous functions $(f_n)$ cannot converge pointwise to $1_\mathbb{Q}$ on $[0,1]$ Unchained Flurry of Blows with Natural Weapons and Feral Combat Training using natural attacks as primary Associates in Integral Domain Let $x$ and $y$ be nonzero elements of an integral domain $D$. Then $x$ and $y$ are associates if and only if $x = yd$ for some unit $d \in D$.    I am done proving the $\Leftarrow$ part. For $\Rightarrow$ what I did was: If $x$ and $y$ are associates then $x \mid y$ and $y \mid x$, so $x \mid y$ implies that $xs = y$ for some $s \in D$ and $y \mid x$ implies that $yt = x$ for some $t \in D$. That is, $yts=y$ which implies $ts=1$. Therefore $s$ is a unit and $t$ is a unit.    Am I on the right track? Can I say that the proof is complete? Where's my 5 minute grace period gone? I just posted an answer. (Revision history .)  I edited it a few seconds later (within my 5 minute grace period), and it comes up as a new revision!? Why?    ^^You can see 'answered 1 min ago', and then 'edited 1 min ago' - how is that possible?  Additionally, !?    I don't think this is a dupe of . See my comments on AI.E's answer. If you're a mod, it will really help. Is there a 'rule of thumb' that I can use to estimate depth of field while shooting? I can use a DoF calculator, or crunch the heavy math by hand if I really want to know exactly what my DoF is going to be... but most of the time knowing exactly is actually overkill, and taking the time to pull out a DoF calculator is impractical. I'm wondering if anyone knows of a 'rule of thumb' that is common for quickly figuring out a rough estimate of what my DoF will be when I'm in the field... Is it possible to decompose a hermitian and unitrary matrix $A$ into the sum of the Pauli matrix Kronecker products?   For example, I have a matrix 16x16 and want it to be decomposed into something like $$A =\sum_{i,j,k,l}h_{ijkl}\sigma_i\otimes\sigma_j\otimes\sigma_k\otimes\sigma_l$$ I can't find any clear explanation how it can be done. I found only this for two-dimentional case: Notation for infinite product in reverse order I'm looking for mathematics books, courses + exercises for high school level. My daughter was high school certificated but she has stopped her studies for 5 years. She would like to be involved in new educational program but she needs to restore her mathematic capabilities.  Could you help me to identify which mathematics books can help her?  Thanks a lot for your reply,  FR. How to record how much time user has spent on my node? I want to record the time a user has spent on my particular node so I could show a pop up to the user to register once the user has read 3 article. But the user must have spent at least 30 seconds on each node.   There is the  module available, but I wonder if I can merge it with another (custom) module I have created (which records the number of nodes user have visited)? What is the difference between "accumulative" and "cumulative"? I'm having a hard time understanding the real distinction between  and .  accumulative     adjective         tending to accumulate or arising from accumulation; cumulative.   tending to accumulate wealth; acquisitive.      cumulative     adjective         increasing or growing by accumulation or successive additions: the cumulative effect of one rejection after another.   formed by or resulting from accumulation or the addition of successive parts or elements.   of or pertaining to interest or dividends that, if not paid when due, become a prior claim for payment in the future: cumulative preferred stocks.      These definitions (and those from other dictionaries as well) say different things but I can't understand how they aren't really meaning the same thing.  Yet, when thinking about it, it seems there are some cases where it is distinctly more correct to use one or the other.  What's the difference, practically? $k$ times's draw from $n$ numbers with replacement, each number at least appear once Sample $k$ times with order from $n$ distinct numbers with replacement where $k\ge n$. Here "with order" means the sample is treated like a sequence rather than a set, so results like "1,3,3" and "3,1,3" are different.  The question is what is the probability that every number is sampled at least once? My answer is $1-\frac{{\sum\limits_{i = 1}^n {C_n^i\times i! \times {{(n - i)}^k}} }}{{{n^k}}}$ where $C_n^i$ denotes $n$ chooses $i$.  ${C_n^i\times i! \times {{(n - i)}^k}}$ means first choose $i$ ($i=1,2,...,n-1$) of numbers not to appear in the sample, and then we sample from the remaining $n-i$ numbers for $k$ times.   My question is, is there more elegant solution where the numerator can be directly computed? i.e. can we directly calculate the number of possible sample sequences in which every number has at least one occurrence? Thank you!    PS: my attempt was $C_k^n\times n!\times n^{n-k}$, meaning that we first choose $n$ positions in the sequence of length $k$ to place $n$ numbers, and then permute the $n$ numbers. This is to ensure every number to appear once. The remaining $n-k$ are sampled from the $n$ numbers without restriction.   However, I later found this seems not correct, and it counts the same sequence multiple times.  PS2: as pointed out in the comments, my first answer "1- ..." is not correct either. How can I make a dispenser that has unlimited arrows?