1. [SOLVED] Multi-Indexed Sums/Intersection/Unions, etc.

I want to do a multi-indexed sum, I have figured out one way to do it but it is ugly. Can someone help me fix the following so that the text is of equal size?
$\displaystyle \sum_{\stackrel{k=1}{k\ne j}}^n A(i,k) \cdot 0_R$

2. Originally Posted by lvleph
I want to do a multi-indexed sum, I have figured out one way to do it but it is ugly. Can someone help me fix the following so that the text is of equal size?
$\displaystyle \sum_{\stackrel{k=1}{k\ne j}}^n A(i,k) \cdot 0_R$
$\displaystyle \sum_{\scriptstyle k=1\atop\scriptstyle k\ne j}^n A(i,k) \cdot 0_R$ (\sum_{\scriptstyle k=1\atop\scriptstyle k\ne j}^n A(i,k) \cdot 0_R).

3. Originally Posted by lvleph
I want to do a multi-indexed sum, I have figured out one way to do it but it is ugly. Can someone help me fix the following so that the text is of equal size?
$\displaystyle \sum_{\stackrel{k=1}{k\ne j}}^n A(i,k) \cdot 0_R$
Use \substack instead of \stackrel : \sum_{\substack{k=1\\ k\ne j}}^n A(i,k) \cdot 0_R gives $\displaystyle \sum_{\substack{k=1\\ k\ne j}}^n A(i,k) \cdot 0_R$