In response to: Sum of Pascal's triangle reciprocals

Approved additions to these Online Encyclopedia of Integer Sequences (OEIS):# HermannSW

## Re: Sum of Pascal's triangle reciprocals |

## xs:decimal()
XSLT 2.0 data type xs:decimal is available on DataPower:
http://publib.boulder.ibm.com/infocenter/wsdatap/v3r8m1/index.jsp?topic=/xs40/extensionfunctions146.htm By the XPath 2.0 spec xs:decimal has to be applied to an atomic type: http://www.w3.org/TR/xpath-functions/#constructor-functions-for-xsd-types ... * xs:decimal($arg as xs:anyAtomicType?) as xs:decimal? ... If you need to apply xs:decimal() to a node-set you may want to use recursive function func:sum() from this stylesheet martins.xsl: Be aware that xs:decimal does not work without "XSLT 2.0" being selected in Compile options policy of the XML manager: With "XSLT 2.0" being selected in Compile options policy of the XML manager (here for coproc2 service, or for your service) everything is fine: Hermann. |

## Sum of Pascal's triangle reciprocals
Many binomial identities are known, and Pascal's triangle is well known, too.
I asked myself back in 1983 at school: What is the sum of the reciprocals of Pascal's triangle? Of course the sum is infinite because of the 1's on left and right border. Of course the sum is infinite again because of the harmonic series on left and right border. And the answer was (and is) 3/2 ! So based on the Theorem further below the Corollary (sum being 3/2) can be prooven pretty easily. And here is the main Theorem, a nice decomposition of each unit fraction into binomial coefficient reciprocals. Starting summation of binomial coefficient reciprocals at row j+1 for column j gives 1/(j-1).
My proof is by mathematical induction, two A4 pages long and will not be posted here. It is left as exercise to the reader ;-) So, why is this posting marked with XSLT tag? Easier to proof it the theorem validity can just be "seen" by actually doing the summations.
Hermann. |