Is there an easy way in .NET to get "st", "nd", "rd" and "th" endings for numbers?
Is there an easy way to create ordinals in C#?
There have been a few questions regarding installing this package in the past, but they now seem to be out of date. I'm using MiKTeX 2.9 and TexMaker. When I try \usepackage{mathtools} in TexMaker it will try to install the package for me but will fail. I took the advice given in this thread:   As suggested I tried installing the mh package using the MiKTeX Package Manager, unfortunately I get the "unknown archive size" error, which I have read means that the package no longer exists. Another thread (lost the link) said you can use the MiKTeX Package Manager to directly install mathtools, however I do not see mathtools listed anywhere in the MiKTeX Package Manager...   So I ask, is the package under a different name? Are there any other ways to install this package? How to invoke a system call via syscall or sysenter in inline assembly? There is an experimental timeline view for questions now available on meta ONLY! (Now working on SO, SF, and SU as well)  This is partially motivated by comments about how difficult it is to follow very active questions which have a lot of activity, and also the feedback on the API which was heavily dominated by "we need to know what happened in this time range" type responses.  It can only be accessed through URL hackery at the moment. To get to it, enter question URLs like so:  https://meta.stackexchange.com/posts/{id}/timeline  This is a chronological timeline of everything that happened on a question, including   initial question ask answers  revisions comments closure, deletion, reopen, undelete, etc votes   all based on when they happened in chronological order.  We are thinking about making this a fourth tab on the question, like so:  Timeline | Oldest | Newest | Votes  Please try it out and provide feedback. It is still a little rough, so we are not looking for highly detailed bug reports, just more general feedback.  Timeline view for this question: How can I make a logo in Adobe Illustrator like the AntiParticle logo below, from ?   It is a large number circles of different, varying sizes, which form the shape of a text character. Why KL divergence is non-negative? Why is KL divergence non-negative?  From the perspective of information theory, I have such an intuitive understanding:  Say there are two ensembles $A$ and $B$ which are composed of the same set of elements labeled by $x$. $p(x)$ and $q(x)$ are different probability distributions over ensemble $A$ and $B$ respectively.   From the perspective of information theory, $\log_{2}(P(x))$ is the least amount of bits that required for recording an element $x$ for ensemble $A$. So that the expectation $$\sum_{x \in  ensemble}-p(x)\ln(p(x))$$ can be interpreted as at least how many bits that we need for recording an element in $A$ on average.   Since this formula puts a lower bound on the bits that we need on average, so that for a different ensemble $B$ which brings about a different probability distribution $q(x)$, the bound that it gives for each element $x$ will surely not bit that is given by $p(x)$, which means taking the expectation, $$\sum_{x\in ensemble}-p(x)\ln(q(x))$$ this average length will surely be greater than the former one, which leads to $$\sum_{x\in ensemble }p(x)\frac{\ln(p(x))}{\ln(q(x))} &gt; 0$$  I don't put $\ge$ here since $p(x)$ and $q(x)$ are different.  This is my intuitive understanding, is there a purely mathematical way of proving KL divergence is non-negative? The problem can be stated as:  Given $p(x)$ and $q(x)$ are both positive over real line, and $\int_{-\infty}^{+\infty}p(x)dx = 1$, $\int_{-\infty}^{+\infty}q(x)dx = 1$.  Prove $$\int_{-\infty}^{+\infty}p(x)\ln\frac{p(x)}{q(x)}$$ is non-negative.  How can this be proved? Or can this be proved without extra conditions? Can't transfer purchases from iPhone to iTunes in iOS 9 How do I create a vertical version of \not? bash prompt messed up on arrow up I have made some modification to my prompt with use of colors via tput.  It looks like now when I try to do an arrow up lookup after few moves up, the prompt is being cut into half, what I mean by this is:  From this:  PROD mysuer@server1.domain.com:~$ vim .bashrc   To this:  PROD mysuer@servegit rebase origin/add_pool   ctrl + c brings everything back to normal.  I have found some posts indicating that this may be due to the issue with missing escapes for [ however I don't see an issue here:  My code:  #red for prod, green for lab  COLOUR_RESET=$(tput sgr0) COLOUR_GREEN=$(tput setaf 2) COLOUR_BLUE=$(tput setaf 6) COLOUR_YELLOW=$(tput setaf 3) COLOUR_RED=$(tput setaf 1) BOLD=$(tput bold)  if [[ $HOSTNAME =~ .*\.domain.com$ ]]; then   COLOUR=$COLOUR_RED   PROMPT_TEXT="PROD" fi  if [[ $HOSTNAME =~ .*\.lab$ ]]; then   COLOUR=$COLOUR_BLUE   PROMPT_TEXT="LAB" fi   MYPROMPT="$COLOUR$BOLD$PROMPT_TEXT$COLOUR_RESET \[\u@$COLOUR$BOLD$(hostname -f)$COLOUR_RESET:\w\]\$ "  PS1=$MYPROMPT   UPDATE: @KamilMaciorowski has pointed out a similar question although it was not relating to a tput colors. Search and download audio-only from youtube Is there a way to search and then download from YouTube, with the situation that I only need to download the audio only, not the video. If every compact set is closed, then is the space Hausdorff? What constitutes protons? When I see pictures, I can't understand. Protons are made of quarks, but some say that they are made of 99% empty space. Also, in this illustration from Wikipedia, what's between the quarks? Am I correct to say the difference between a signed and unsigned integer is:  Unsigned can hold a larger positive value and no negative value. Unsigned uses the leading bit as a part of the value, while the signed version uses the left-most-bit to identify if the number is positive or negative. Signed integers can hold both positive and negative numbers.  Any other differences? Convergence of $\sum_{n=1}^\infty{\left(\sqrt[n]{n}-1\right)}$ How to increase the signal power of a wi-fi card? I use an atheros card that requires ath9k driver. Are there any tools that can be used to increase the signal power of the wi-fi card? How does Fermat's principle make light choose a straight path over a short path? This is a thought experiment where I have made a &quot;C&quot; shaped hole inside diamond. The refractive index $(\mu)$ of diamond is 2.45. Say we shine a laser from top of the &quot;C&quot; as shown. My calculations show that light reaching A can reach B in the least possible time if gone through the &quot;C&quot;. but I'm pretty sure the perpendicular laser beam travels undeflected and straight down. Though I don't have experimental evidence, I see something wrong either with my intuition or with the theory. It would be great if someone could clarify. *       'a' in the diagram is the thickness of the cutout and all comparable distances can be taken 'a'. Exclusion in formation of comparative statements I was going through the topic "formation of comparative and superlative".       The rule says     When two objects are compared with each other, the latter term of comparison must exclude the former, as in "Iron is more useful than any other metal". If we say "Iron is more useful than any metal", that is the same thing as saying    "Iron is more useful than iron", since iron is itself a metal.   I am finding difficulty to relate the rule with example. Remove space around tikz prove every connected manifold is path connected manifold .       my thought:      connected space : Let $ X$  be a topological space. A separation of $ X $ is a pair $U, V$ of disjoint    nonempty open subsets of $ X $ whose union is $X$. The space $ X $ is said to be connected    if there does not exist a separation of  $X$ .      Components: Given  $X$ , define an equivalence relation on $X$ by setting x~y if there    is a connected subspace of $X$  containing both $ x$  and $ y$ . The equivalence classes are    called the components (or the "connected components") of $ X$.       Path Component: I define another equivalence relation on the space $ X$  by defining x ~ у    if there is a path in $ X$  from $ x$  to $ y$ . The equivalence classes are called the path components of $ X$ .       Theorem  : The path components of $ X$  are path connected disjoint subspaces    of $X$  whose union is $X$ , such that each nonempty path connected subspace of $X$  intersects only one of them.       thank you so much Why should we care about groups at all? Can anyone suggest a detailed installation process for Ubuntu on Windows 8.2?