Prove $sum_{k=0}^n binom{m+k}{m} = binom{m+n+1}{m+1}$ using the binomium of Newton












1












$begingroup$


Prove
$$ sum_{k=0}^n binom{m+k}{m} = binom{m+n+1}{m+1} $$
by considering the coefficient of $x^n$ in $(1-x)^{-1} (1-x)^{-m-1} = (1-x)^{-m-2}$.



I have succeeded in proving this using induction and in a combinatorial way, but I need to practice with power series.



Background: third year mathematics at university



My attempt



The given equality can be rewritten as



$$ left( sum_{k=0}^infty binom{-1} k (-x)^k right) left( sum_{ell=0}^infty binom{-m-1}{ell} (-x)^ell right) = sum_{n=0}^infty binom{-m-2}{n} x^n (-1)^n $$



and we can work out the left-hand side as



$$ sum_{n=0}^infty sum_{k+ell=n} binom{-1}{k} binom{-m-1}{ell} (-x)^{k+ell} = sum_{n=0}^infty sum_{k=0}^n binom{-1}{k} binom{-m-1}{n-k} x^n (-1)^n $$



and now we equate the coefficients in front of $x^n$ on both sides to get



$$ sum_{k=0}^n binom{-1}{k} binom{-m-1}{n-k} = binom{-m-2}{n}. $$



But how to proceed? Because I don't see the original equation in this.






combinatorics binomial-coefficients







share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    Hockey Stick Identity
    $endgroup$
    – Yadati Kiran
    Dec 19 '18 at 8:20










  • $begingroup$
    @YadatiKiran Thanks for the link, it is indeed the same! Now to figure out from the many answers how to prove it using power series.
    $endgroup$
    – PHPirate
    Dec 19 '18 at 8:52










  • $begingroup$
    Ok maybe it is not quite the same, there are ideas in those answers similar to mine but the problem here remains.
    $endgroup$
    – PHPirate
    Dec 19 '18 at 9:10
















1












$begingroup$


Prove
$$ sum_{k=0}^n binom{m+k}{m} = binom{m+n+1}{m+1} $$
by considering the coefficient of $x^n$ in $(1-x)^{-1} (1-x)^{-m-1} = (1-x)^{-m-2}$.



I have succeeded in proving this using induction and in a combinatorial way, but I need to practice with power series.



Background: third year mathematics at university



My attempt



The given equality can be rewritten as



$$ left( sum_{k=0}^infty binom{-1} k (-x)^k right) left( sum_{ell=0}^infty binom{-m-1}{ell} (-x)^ell right) = sum_{n=0}^infty binom{-m-2}{n} x^n (-1)^n $$



and we can work out the left-hand side as



$$ sum_{n=0}^infty sum_{k+ell=n} binom{-1}{k} binom{-m-1}{ell} (-x)^{k+ell} = sum_{n=0}^infty sum_{k=0}^n binom{-1}{k} binom{-m-1}{n-k} x^n (-1)^n $$



and now we equate the coefficients in front of $x^n$ on both sides to get



$$ sum_{k=0}^n binom{-1}{k} binom{-m-1}{n-k} = binom{-m-2}{n}. $$



But how to proceed? Because I don't see the original equation in this.






combinatorics binomial-coefficients







share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    Hockey Stick Identity
    $endgroup$
    – Yadati Kiran
    Dec 19 '18 at 8:20










  • $begingroup$
    @YadatiKiran Thanks for the link, it is indeed the same! Now to figure out from the many answers how to prove it using power series.
    $endgroup$
    – PHPirate
    Dec 19 '18 at 8:52










  • $begingroup$
    Ok maybe it is not quite the same, there are ideas in those answers similar to mine but the problem here remains.
    $endgroup$
    – PHPirate
    Dec 19 '18 at 9:10














1












1








1





$begingroup$


Prove
$$ sum_{k=0}^n binom{m+k}{m} = binom{m+n+1}{m+1} $$
by considering the coefficient of $x^n$ in $(1-x)^{-1} (1-x)^{-m-1} = (1-x)^{-m-2}$.



I have succeeded in proving this using induction and in a combinatorial way, but I need to practice with power series.



Background: third year mathematics at university



My attempt



The given equality can be rewritten as



$$ left( sum_{k=0}^infty binom{-1} k (-x)^k right) left( sum_{ell=0}^infty binom{-m-1}{ell} (-x)^ell right) = sum_{n=0}^infty binom{-m-2}{n} x^n (-1)^n $$



and we can work out the left-hand side as



$$ sum_{n=0}^infty sum_{k+ell=n} binom{-1}{k} binom{-m-1}{ell} (-x)^{k+ell} = sum_{n=0}^infty sum_{k=0}^n binom{-1}{k} binom{-m-1}{n-k} x^n (-1)^n $$



and now we equate the coefficients in front of $x^n$ on both sides to get



$$ sum_{k=0}^n binom{-1}{k} binom{-m-1}{n-k} = binom{-m-2}{n}. $$



But how to proceed? Because I don't see the original equation in this.






combinatorics binomial-coefficients







share|cite|improve this question









$endgroup$




Prove
$$ sum_{k=0}^n binom{m+k}{m} = binom{m+n+1}{m+1} $$
by considering the coefficient of $x^n$ in $(1-x)^{-1} (1-x)^{-m-1} = (1-x)^{-m-2}$.



I have succeeded in proving this using induction and in a combinatorial way, but I need to practice with power series.



Background: third year mathematics at university



My attempt



The given equality can be rewritten as



$$ left( sum_{k=0}^infty binom{-1} k (-x)^k right) left( sum_{ell=0}^infty binom{-m-1}{ell} (-x)^ell right) = sum_{n=0}^infty binom{-m-2}{n} x^n (-1)^n $$



and we can work out the left-hand side as



$$ sum_{n=0}^infty sum_{k+ell=n} binom{-1}{k} binom{-m-1}{ell} (-x)^{k+ell} = sum_{n=0}^infty sum_{k=0}^n binom{-1}{k} binom{-m-1}{n-k} x^n (-1)^n $$



and now we equate the coefficients in front of $x^n$ on both sides to get



$$ sum_{k=0}^n binom{-1}{k} binom{-m-1}{n-k} = binom{-m-2}{n}. $$



But how to proceed? Because I don't see the original equation in this.






combinatorics binomial-coefficients




combinatorics binomial-coefficients






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 19 '18 at 8:06









PHPiratePHPirate

328417




328417








  • 1




    $begingroup$
    Hockey Stick Identity
    $endgroup$
    – Yadati Kiran
    Dec 19 '18 at 8:20










  • $begingroup$
    @YadatiKiran Thanks for the link, it is indeed the same! Now to figure out from the many answers how to prove it using power series.
    $endgroup$
    – PHPirate
    Dec 19 '18 at 8:52










  • $begingroup$
    Ok maybe it is not quite the same, there are ideas in those answers similar to mine but the problem here remains.
    $endgroup$
    – PHPirate
    Dec 19 '18 at 9:10














  • 1




    $begingroup$
    Hockey Stick Identity
    $endgroup$
    – Yadati Kiran
    Dec 19 '18 at 8:20










  • $begingroup$
    @YadatiKiran Thanks for the link, it is indeed the same! Now to figure out from the many answers how to prove it using power series.
    $endgroup$
    – PHPirate
    Dec 19 '18 at 8:52










  • $begingroup$
    Ok maybe it is not quite the same, there are ideas in those answers similar to mine but the problem here remains.
    $endgroup$
    – PHPirate
    Dec 19 '18 at 9:10








1




1




$begingroup$
Hockey Stick Identity
$endgroup$
– Yadati Kiran
Dec 19 '18 at 8:20




$begingroup$
Hockey Stick Identity
$endgroup$
– Yadati Kiran
Dec 19 '18 at 8:20












$begingroup$
@YadatiKiran Thanks for the link, it is indeed the same! Now to figure out from the many answers how to prove it using power series.
$endgroup$
– PHPirate
Dec 19 '18 at 8:52




$begingroup$
@YadatiKiran Thanks for the link, it is indeed the same! Now to figure out from the many answers how to prove it using power series.
$endgroup$
– PHPirate
Dec 19 '18 at 8:52












$begingroup$
Ok maybe it is not quite the same, there are ideas in those answers similar to mine but the problem here remains.
$endgroup$
– PHPirate
Dec 19 '18 at 9:10




$begingroup$
Ok maybe it is not quite the same, there are ideas in those answers similar to mine but the problem here remains.
$endgroup$
– PHPirate
Dec 19 '18 at 9:10










1 Answer
1






active

oldest

votes


















1












$begingroup$

I mean, you're pretty much done from where you got at. Just note that ${ -1 choose k}=(-1)^k$ and ${-m-2 choose n}= {m+n+1 choose n}$(up to some minus sign) and ${-m-1 choose k}={m+k choose k}$(use this instead of ${-m-1 choose n-k}$ on the LHS of your identity by just changing k to n-k). To prove these identities just write out your binomial coefficients in full.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Indeed it almost works out, I have the LHS equal but for the RHS I have $binom{-m-2}{n}=(-1)^n binom{m+n+1}{n}$, so it is almost equal to $binom{m+n+1}{m+1}$ except for the minus sign, which stays, right?
    $endgroup$
    – PHPirate
    Dec 19 '18 at 9:36










  • $begingroup$
    What do you mean by the "minus sign stays"? The minus signs on the LHS should balance those on the RHS, please check carefully.
    $endgroup$
    – Sorin Tirc
    Dec 19 '18 at 9:39










  • $begingroup$
    For the LHS I have that they are exactly equal: $binom{-1}{k} binom{-m-1}{k} = (-1)^k (-1)^k binom{m+k}{k}=binom{m+k}{m}$ as you say, so that's not where the $(-1)^n$ disappears.
    $endgroup$
    – PHPirate
    Dec 19 '18 at 9:40










  • $begingroup$
    Oh I see, I have a $(-1)^n$ wrong in my attempt in the question! Thanks!
    $endgroup$
    – PHPirate
    Dec 19 '18 at 9:45











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3046152%2fprove-sum-k-0n-binommkm-binommn1m1-using-the-binomium-of-n%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes









1












$begingroup$

I mean, you're pretty much done from where you got at. Just note that ${ -1 choose k}=(-1)^k$ and ${-m-2 choose n}= {m+n+1 choose n}$(up to some minus sign) and ${-m-1 choose k}={m+k choose k}$(use this instead of ${-m-1 choose n-k}$ on the LHS of your identity by just changing k to n-k). To prove these identities just write out your binomial coefficients in full.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Indeed it almost works out, I have the LHS equal but for the RHS I have $binom{-m-2}{n}=(-1)^n binom{m+n+1}{n}$, so it is almost equal to $binom{m+n+1}{m+1}$ except for the minus sign, which stays, right?
    $endgroup$
    – PHPirate
    Dec 19 '18 at 9:36










  • $begingroup$
    What do you mean by the "minus sign stays"? The minus signs on the LHS should balance those on the RHS, please check carefully.
    $endgroup$
    – Sorin Tirc
    Dec 19 '18 at 9:39










  • $begingroup$
    For the LHS I have that they are exactly equal: $binom{-1}{k} binom{-m-1}{k} = (-1)^k (-1)^k binom{m+k}{k}=binom{m+k}{m}$ as you say, so that's not where the $(-1)^n$ disappears.
    $endgroup$
    – PHPirate
    Dec 19 '18 at 9:40










  • $begingroup$
    Oh I see, I have a $(-1)^n$ wrong in my attempt in the question! Thanks!
    $endgroup$
    – PHPirate
    Dec 19 '18 at 9:45
















1












$begingroup$

I mean, you're pretty much done from where you got at. Just note that ${ -1 choose k}=(-1)^k$ and ${-m-2 choose n}= {m+n+1 choose n}$(up to some minus sign) and ${-m-1 choose k}={m+k choose k}$(use this instead of ${-m-1 choose n-k}$ on the LHS of your identity by just changing k to n-k). To prove these identities just write out your binomial coefficients in full.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Indeed it almost works out, I have the LHS equal but for the RHS I have $binom{-m-2}{n}=(-1)^n binom{m+n+1}{n}$, so it is almost equal to $binom{m+n+1}{m+1}$ except for the minus sign, which stays, right?
    $endgroup$
    – PHPirate
    Dec 19 '18 at 9:36










  • $begingroup$
    What do you mean by the "minus sign stays"? The minus signs on the LHS should balance those on the RHS, please check carefully.
    $endgroup$
    – Sorin Tirc
    Dec 19 '18 at 9:39










  • $begingroup$
    For the LHS I have that they are exactly equal: $binom{-1}{k} binom{-m-1}{k} = (-1)^k (-1)^k binom{m+k}{k}=binom{m+k}{m}$ as you say, so that's not where the $(-1)^n$ disappears.
    $endgroup$
    – PHPirate
    Dec 19 '18 at 9:40










  • $begingroup$
    Oh I see, I have a $(-1)^n$ wrong in my attempt in the question! Thanks!
    $endgroup$
    – PHPirate
    Dec 19 '18 at 9:45














1












1








1





$begingroup$

I mean, you're pretty much done from where you got at. Just note that ${ -1 choose k}=(-1)^k$ and ${-m-2 choose n}= {m+n+1 choose n}$(up to some minus sign) and ${-m-1 choose k}={m+k choose k}$(use this instead of ${-m-1 choose n-k}$ on the LHS of your identity by just changing k to n-k). To prove these identities just write out your binomial coefficients in full.






share|cite|improve this answer









$endgroup$



I mean, you're pretty much done from where you got at. Just note that ${ -1 choose k}=(-1)^k$ and ${-m-2 choose n}= {m+n+1 choose n}$(up to some minus sign) and ${-m-1 choose k}={m+k choose k}$(use this instead of ${-m-1 choose n-k}$ on the LHS of your identity by just changing k to n-k). To prove these identities just write out your binomial coefficients in full.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered Dec 19 '18 at 9:14









Sorin TircSorin Tirc

1,675213




1,675213












  • $begingroup$
    Indeed it almost works out, I have the LHS equal but for the RHS I have $binom{-m-2}{n}=(-1)^n binom{m+n+1}{n}$, so it is almost equal to $binom{m+n+1}{m+1}$ except for the minus sign, which stays, right?
    $endgroup$
    – PHPirate
    Dec 19 '18 at 9:36










  • $begingroup$
    What do you mean by the "minus sign stays"? The minus signs on the LHS should balance those on the RHS, please check carefully.
    $endgroup$
    – Sorin Tirc
    Dec 19 '18 at 9:39










  • $begingroup$
    For the LHS I have that they are exactly equal: $binom{-1}{k} binom{-m-1}{k} = (-1)^k (-1)^k binom{m+k}{k}=binom{m+k}{m}$ as you say, so that's not where the $(-1)^n$ disappears.
    $endgroup$
    – PHPirate
    Dec 19 '18 at 9:40










  • $begingroup$
    Oh I see, I have a $(-1)^n$ wrong in my attempt in the question! Thanks!
    $endgroup$
    – PHPirate
    Dec 19 '18 at 9:45


















  • $begingroup$
    Indeed it almost works out, I have the LHS equal but for the RHS I have $binom{-m-2}{n}=(-1)^n binom{m+n+1}{n}$, so it is almost equal to $binom{m+n+1}{m+1}$ except for the minus sign, which stays, right?
    $endgroup$
    – PHPirate
    Dec 19 '18 at 9:36










  • $begingroup$
    What do you mean by the "minus sign stays"? The minus signs on the LHS should balance those on the RHS, please check carefully.
    $endgroup$
    – Sorin Tirc
    Dec 19 '18 at 9:39










  • $begingroup$
    For the LHS I have that they are exactly equal: $binom{-1}{k} binom{-m-1}{k} = (-1)^k (-1)^k binom{m+k}{k}=binom{m+k}{m}$ as you say, so that's not where the $(-1)^n$ disappears.
    $endgroup$
    – PHPirate
    Dec 19 '18 at 9:40










  • $begingroup$
    Oh I see, I have a $(-1)^n$ wrong in my attempt in the question! Thanks!
    $endgroup$
    – PHPirate
    Dec 19 '18 at 9:45
















$begingroup$
Indeed it almost works out, I have the LHS equal but for the RHS I have $binom{-m-2}{n}=(-1)^n binom{m+n+1}{n}$, so it is almost equal to $binom{m+n+1}{m+1}$ except for the minus sign, which stays, right?
$endgroup$
– PHPirate
Dec 19 '18 at 9:36




$begingroup$
Indeed it almost works out, I have the LHS equal but for the RHS I have $binom{-m-2}{n}=(-1)^n binom{m+n+1}{n}$, so it is almost equal to $binom{m+n+1}{m+1}$ except for the minus sign, which stays, right?
$endgroup$
– PHPirate
Dec 19 '18 at 9:36












$begingroup$
What do you mean by the "minus sign stays"? The minus signs on the LHS should balance those on the RHS, please check carefully.
$endgroup$
– Sorin Tirc
Dec 19 '18 at 9:39




$begingroup$
What do you mean by the "minus sign stays"? The minus signs on the LHS should balance those on the RHS, please check carefully.
$endgroup$
– Sorin Tirc
Dec 19 '18 at 9:39












$begingroup$
For the LHS I have that they are exactly equal: $binom{-1}{k} binom{-m-1}{k} = (-1)^k (-1)^k binom{m+k}{k}=binom{m+k}{m}$ as you say, so that's not where the $(-1)^n$ disappears.
$endgroup$
– PHPirate
Dec 19 '18 at 9:40




$begingroup$
For the LHS I have that they are exactly equal: $binom{-1}{k} binom{-m-1}{k} = (-1)^k (-1)^k binom{m+k}{k}=binom{m+k}{m}$ as you say, so that's not where the $(-1)^n$ disappears.
$endgroup$
– PHPirate
Dec 19 '18 at 9:40












$begingroup$
Oh I see, I have a $(-1)^n$ wrong in my attempt in the question! Thanks!
$endgroup$
– PHPirate
Dec 19 '18 at 9:45




$begingroup$
Oh I see, I have a $(-1)^n$ wrong in my attempt in the question! Thanks!
$endgroup$
– PHPirate
Dec 19 '18 at 9:45


















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid …



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3046152%2fprove-sum-k-0n-binommkm-binommn1m1-using-the-binomium-of-n%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







-

Popular posts from this blog

Bressuire

Image
.mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output .infobox.bordered .mergedrow td,.mw-parser-output .infobox.bordered .mergedrow th{border:0;border-right:1px solid ...
Read more

Cabo Verde

Image
  Nota: Cabo-verdiano redireciona para este artigo. Para a língua falada em Cabo Verde, veja crioulo cabo-verdiano. Para outros significados, veja Cabo Verde (desambiguação). Coordenadas: 14° 55' N 23° 31' O Cabo Verde República de Cabo Verde Bandeira Brasão de Armas Lema: Unidade, Trabalho, Progresso Hino nacional: Cântico da Liberdade Gentílico: cabo-verdiano [ 1 ] Capital Praia 14° 55' N 23° 31' O Cidade mais populosa Praia Língua oficial Português Governo República unitária semipresidencialista [ 2 ]  - Presidente Jorge Carlos Fonseca  - Primeiro-ministro Ulisses Correia e Silva História    - Descoberta 1460   - Independência 00 • de Portugal 5 de Julho de 1975   - Multipartidarismo 13 de Janeiro de 1990  Área    - Total 4 033 km² (146.º)  - Água (%) 0,08 População    - Estimativa para 2017 560 899 [ 3 ] hab. (173.º) ...
Read more

Gyllenstierna

Image
.mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output .infobox.bordered .mergedrow td,.mw-parser-output .infobox.bordered .mergedrow th{border:0;border-right:1px solid ...
Read more