I have a LaTeX document featuring these two index entries:  \index{Farbmodell!$\text{LCh}_{ab}$|main} \index{Farbmodell!$\text{LCh}_{ab}$}   While being "identical" in my view, there are two distinct entries created in the .ind file:    \item Farbmodell     \subitem $\text  {LCh}_{ab}$\hspace{1em}\dotfill\hspace{1em}61     \subitem $\text{LCh}_{ab}$\hspace{1em}\dotfill\hspace{1em}\main{39}   |main just indicates the main index entry, using \newcommand{\main}[1]{\textbf{#1}}. I don't understand where these extra spaces come from.  LaTeX packages being used are:  \documentclass[a4paper,twoside]{report} \usepackage{german} \usepackage[latin1]{inputenc} \usepackage{a4} \usepackage{makeidx} \usepackage{showidx} \usepackage{amsmath} \usepackage{url} \usepackage{graphicx} \usepackage{ifthen} % \makeindex \begin{document}   On output, the relevant index part looks like this:   The first index was entered directly within a section that is part of a chapter, while the second index was entered inside a caption within a table within a section within the appendix. That caption (inside table after tabular) looked like this:  \caption[Pr... im $\text{LCh}_{ab}$ Farbmodell]% {\label{\Lt{PRMG}}Pr... im $\text{LCh}_{ab}$ Farbmodell% \index{Farbmodell!$\text{LCh}_{ab}$} nach \cite[Table~10, S.~15]{ICC.1:2010}}
I want to have an index entry typeset as $a_\text{T}$, so I issue the command \index{at@$a_\text{T}$}. Each use of this index command creates a separate line in the index. How can I get \makeindex to recognize they all reference the same topic?  My index entries look like this:
How to count number of bases and subspaces of a given dimension in a vector space over a finite field? Let $V_{n}(F)$ be a vector space over the field $F=\mathbb Z_{p}$ with $\dim V_{n} = n$, i.e., the cardinality of $V_{n}(\mathbb Z_{p}) = p^{n}$. What is a general criterion to find the number of bases in such a vector space? For example, find the number of bases in $ V_{2}(\mathbb Z_{3})$. Further, how can we find the number of subspaces of dimension, say, $r$?   I need a justification with proof. I have a formula, but I am unable to understand the basic idea behind that formula. Can I use Bluray as a boot cd? What should I look for when shopping for my first DSLR? I am thinking of buying a digital SLR camera. What things should I be looking for? Find the limit: $\displaystyle\lim_{x\to \infty} (\sqrt{x^2+x}-\sqrt{x^2-x})$. What should main() return in C and C++? What is the correct (most efficient) way to define the main() function in C and C++ — int main() or void main() — and why? And how about the arguments? If int main() then return 1 or return 0?  There are numerous duplicates of this question, including:       — For C++, with a very good answer indeed.     Related: Parallel file copy from single source to multiple targets? I have a several large files on optical media I would like to copy to multiple targets - in this case I have two hard drives attached to the same computer. Is there a utility that can function like:  copy source target1 target2 ... targetN Is there any UNIX variant on which a child process dies with its parent? different possible definitions of the exterior derivative? In Helgason, "Differential Geometry, Lie Groups and Symmetric Spaces"  we have the formula for the exterior derivative  $(p+1)d\omega(X_{1}, \ldots X_{p+1})=\Sigma_{i=1}^{p+1} (-1)^{i+1} X_{i} \cdot \omega(X_{1}, \ldots , \hat{X_{i}}, \ldots X_{p+1})+\Sigma_{i&lt;j} (-1)^{i+j}\omega([X_{i}, X_{j}], X_{1}, \ldots , \hat{X_{i}}, \ldots \hat{X_{j}}, \ldots , X_{p+1})$  but in other sources on-line they have the same formula without the factor of $p+1$ on the left-hand side.  Are there two different definitions of the exterior derivative, or is there an error in Helgason? if R is a commutative ring in which all the prime ideals are finitely generated then R is Noetherian Prove that if $R$ is a commutative ring in which all the prime ideals are finitely generated, then $R$ is Noetherian.   Here is what I been told to do: Suppose that $R$ is not Noetherian, and use Zorn’s lemma to obtain a maximal element $I$ in the collection of all ideals of $R$ that are not finitely generated.  Then use the following proposition: Let $I$ be an ideal of a commutative ring $R$, and let $r ∈ R$. If the ideals $I +rR$ and {$s ∈ R : sr ∈ I$} are finitely generated, then $I$ is a finitely generated ideal.  Can anyone help please. thanks a lot. My USB drive used to be originally 8GB when I bought it.  I'm trying to reformatted in Windows 7 by right clicking on the drive and selecting Format.... But the capacity only shows 250MB.  Is there something I can do to get the original size back? Maybe it got partitioned in a weird way?   The  flash drive is a SanDisk Cruzer Micro 8GB. I got it from Wal-Mart but this is the same drive. Stack Exchange doesn't allow me to answer protected questions because I gave away earned rep in bounties I noticed that I can't answer protected questions. I don't want to actually, but it says:        It was , but I also didn't have an ability to answer other protected questions.  I earned 270 reputation points + 100 reputation point bonus. Then I  350 reputation points as a bounty. Then I earned 59 reputation points. Today I started another bounty (50 reputation points), etc – I offered 4 bounties with total 500 rep.  Despite the fact I started from the association bonus, I must have an ability to answer protected questions, as I earned reputation points here. But offered them as bounties.    I now have enough reputation points, but I would like it to be fixed, because I like offering bounties very much.  I would like system to check for my bounties when it checks if I can answer protected question. When defining a method on a class in Python, it looks something like this:  class MyClass(object):     def __init__(self, x, y):         self.x = x         self.y = y   But in some other languages, such as C#, you have a reference to the object that the method is bound to with the "this" keyword without declaring it as an argument in the method prototype.    Was this an intentional language design decision in Python or are there some implementation details that require the passing of "self" as an argument? locale not found/setting locale failed - what should I do? I've installed Debian 7 i386 on my VPS (OpenVZ). Everything works fine, except locales - any attempt to install anything shows:  [...] perl: warning: Setting locale failed. perl: warning: Please check that your locale settings:     LANGUAGE = (unset),     LC_ALL = (unset),     LANG = "pl_PL.UTF-8"     are supported and installed on your system. perl: warning: Falling back to the standard locale ("C"). locale: Cannot set LC_CTYPE to default locale: No such file or directory locale: Cannot set LC_MESSAGES to default locale: No such file or directory locale: Cannot set LC_ALL to default locale: No such file or directory [...]   What I've tried:   Generating locales myself - update-locale LC_ALL="pl_PL.UTF-8" - shows:  apt-get install --reinstall locales  The same with dpkg-reconfigure locales + setting pl_PL.UTF-8, pl_PL.ISO-8859-2 or even en_US:  export LC_ALL=pl_PL.UTF-8 (even on root):  -bash: warning: setlocale: LC_ALL: cannot change locale (pl_PL.UTF-8)    Here is what shows locale:  root:~# locale locale: Cannot set LC_CTYPE to default locale: No such file or directory locale: Cannot set LC_MESSAGES to default locale: No such file or directory locale: Cannot set LC_ALL to default locale: No such file or directory LANG=pl_PL.UTF-8 LANGUAGE= LC_CTYPE="pl_PL.UTF-8" LC_NUMERIC="pl_PL.UTF-8" LC_TIME="pl_PL.UTF-8" LC_COLLATE="pl_PL.UTF-8" LC_MONETARY="pl_PL.UTF-8" LC_MESSAGES="pl_PL.UTF-8" LC_PAPER="pl_PL.UTF-8" LC_NAME="pl_PL.UTF-8" LC_ADDRESS="pl_PL.UTF-8" LC_TELEPHONE="pl_PL.UTF-8" LC_MEASUREMENT="pl_PL.UTF-8" LC_IDENTIFICATION="pl_PL.UTF-8" LC_ALL=   Nothing interesting found in /var/log. Even changing repo to official + purge and manual installation locales doesn't solve my problem, which manifests itself on each fresh installation of Debian 7. What is the difference between client-side and server-side programming? I'm trying to merge two directory trees that have many common elements but also each have elements that are only present in one of the two trees. The main issue I am having is that when mv encounters two sub-directories with the same relative paths it either keeps the source (with -f) or the destination (with -n) but I can't make it take the union of both sub-directories. I could of course use rsync with --remove-source-files but this will actually copy the data and then delete the old files as opposed to a true move. The two directory trees contain several hundred GB of data and are both on same partition so I would love to do a true move if possible for the sake of time.   Right now I have find * -type file -exec mv -n {} /destination/{} but this only moves  files from the source to the destination when the target directory already exists. I can preface this command with something like mv -n * /destination/ but this only brings over the top level directories. Is there any way to do this in a single line? I could  always write a script to check if the directory exists before copying the file but this seems like such a basic task, it seems like there should be an easier way. How to unmap TAB and do not make Ctrl-I invalid in VIM Are collective nouns always plural, or are certain ones singular? I'd say Microsoft have a way of bending the rules and I know that McLaren have won the championship. While this sounds strange, I believe it is correct English (sorry, I'm not native).   But when it's a small company, would you still use it this way? Is a company always plural, or are small companies singular? I.e., would you say Bakery Johnson makes fine bread or Bakery Johnson make fine bread? Is it My book seller, Woody's, have moved or is it has moved? How do I install Netbeans? I used NetBeans for Java development on Windows and remember finding it in the Ubuntu Software Center on Natty, but now it's gone. Is there a PPA I can use or will it be re-added to the official repos? How do I set up an email server? Some common problems with displaying routes created from street data, such as bus routes, include:   Routes may overlap themselves, such as when a route takes the same road in opposite directions Routes may overlap other routes that take the same street. Routes are often overly detailed, or "noisy", owing to their derivation from street data. Indicating a route's direction unambiguously without overloading it with arrows can be a challenge.   What are some techniques for dealing with these issues in order to create a practical and usable route map, such as this ? Do you know of any such public transport maps that were produced by automatic techniques rather than manual illustration/digitization?  Specifically I am using ArcGIS 10, but solutions involving other software are welcome as well.  One technique I have had some success with for dealing with 1) is using ArcMap's  with a negative offset -- assuming the lines are oriented in the direction of travel, this will offset the lines such that the right and left-hand sides are distinct and oriented as you would expect (at least for  countries, for left-hand traffic countries one would use a positive offset). However the result tends to be a bit wonky around turns, interchanges and and U-turns, and is inflexible when dealing with multiple routes.  Another possibility that I am not very familiar with but which seems promising is  -- however, I have not had much luck in finding examples of using representations for transportation maps and whether it might fit the bill.