Search

In this paper, by using the residue method of complex analysis, we obtain an explicit partial fraction decomposition for the general rational function x M (x + 1) n λ (M is any nonnegative integer, λ and n are any positive integers). As applications, we deduce the corresponding algebraic identities and combinatorial identities which are the corresponding extensions of Chu' results. We also give some explicit formulas of Apostol-type polynomials and harmonic Stirling numbers of the second kind. [ABSTRACT FROM AUTHOR]

In this paper, we present new kinds of reciprocal sums of finite products of general second order linear recurrences. In order to evaluate explicitly them by q-calculus, first we convert them into their q-notation and then use the methods of partial fraction decomposition and creative telescoping. [ABSTRACT FROM AUTHOR]

Sums of products of two Gaussian q-binomial coeficients, are investigated, one of which includes two additional parameters, with a parametric rational weight function. By means of partial fraction decomposition, first the main theorems are proved and then some corollaries of them are derived. Then these q-binomial identities will be transformed into Fibonomial sums as consequences. [ABSTRACT FROM AUTHOR]

A class of double sums with binomial coefficients are evaluated by combining finite differences with partial fraction decompositions. [ABSTRACT FROM AUTHOR]

We present a method for finding partial fraction decompositions of rational functions with linear or quadratic factors in the denominators by means of repeated polynomial divisions. This method does not involve differentiation or solving linear equations for obtaining the unknown partial fraction coefficients, which is very suitable for either hand or machine calculations. Some illustrative examples are provided. [ABSTRACT FROM AUTHOR]

Recently Melham [1] gives closed formulæ for certain finite reciprocal sums. In this paper, we present a different approach to compute these sums in closed form. Our approach is straight-forward and simple. First we convert the sums in q-notation, then use partial fraction decomposition and telescoping to derive closed formulæ. [ABSTRACT FROM AUTHOR]

By means of finite differences and partial fraction decomposition, we establish two binomial transformations, that extend, with four free parameters, the recent results due to Prodinger (2010) and Dahlberg-Ferdinands-Tefera (2010). [ABSTRACT FROM AUTHOR]

The generating function for , the number of partitions of into at most parts, may be written as a product of factors. We find the behavior of coefficients in the partial fraction decomposition of this product as by applying the saddle-point method, where the saddle-point we need is associated to a zero of the analytically continued dilogarithm. Our main result disproves a conjecture of Rademacher. [ABSTRACT FROM AUTHOR]

We provide new formulas for the coefficients in the partial fraction decomposition of the restricted partition generating function. These techniques allow us to partially resolve a recent conjecture of Sills and Zeilberger. We also describe upcoming work, giving a resolution to Rademacher's conjecture on the asymptotics of these coefficients. [ABSTRACT FROM AUTHOR]

In his book Topics in Analytic Number Theory (1973), Hans Rademacher considered the generating function of integer partitions into at most N parts and conjectured certain limits for the coefficients of its partial fraction decomposition. We carry out an asymptotic analysis that disproves this conjecture, thus confirming recent observations of Sills and Zeilberger (Journal of Difference Equations and Applications 19 (2013)), who gave strong numerical evidence against the conjecture. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, a simple cover-up approach for computing partial fractions with linear or irreducible quadratic factors in the denominators is presented. It mainly involves polynomial divisions and substitutions only, without having to factorize the irreducible quadratic factors into linear factors with complex coefficients, to use differentiation or to solve a system of linear equations. Examples and its application to derive some useful formulas of partial fraction decompositions are included. [Copyright &y& Elsevier]

Partial fraction decomposition is a useful technique often taught at senior secondary or undergraduate levels to handle integrations, inverse Laplace transforms or linear ordinary differential equations, etc. In recent years, an improved Heaviside's approach to partial fraction decomposition was introduced and developed by the author. An important feature of this approach is that there is no need to solve a system of linear equations or to use differentiations to find the unknown coefficients of the partial fractions. In order to study its potential application in mathematics education at the undergraduate level, a pilot study of tryout at the Hong Kong Institute of Education has been conducted. The data are collected via quizzes, questionnaires and face-to-face interviews. In this article, the results and implications will be discussed. In general, according to the responses and feedbacks from the instructors and students concerned, the improved Heaviside approach is suitable to be introduced at the undergraduate level, as an alternative to the method of undetermined coefficients described in common undergraduate mathematics textbooks. [ABSTRACT FROM PUBLISHER]

In this note, a new method for computing the partial fraction decomposition of rational functions with irreducible quadratic factors in the denominators is presented. This method involves polynomial divisions and substitutions only, without having to solve for the complex roots of the irreducible quadratic polynomial or to solve a system of linear equations. Some examples of its applications are included. [ABSTRACT FROM AUTHOR]

Recently, McCarthy presented two algebraic identities involving binomial coefficients and harmonic numbers, one of which generalizes an identity used to prove the Apéry number supercongruence. In 2008, Prodinger provided human proofs of identities initially obtained by Osburn and Schneider using the computer program Sigma. In this paper, we establish q -analogs of a fair number of the identities appearing in McCarthy (Integers 11 (2011): A37) and Prodinger (Integers 8 (2008): A10) by making use of q -partial fractions. [ABSTRACT FROM AUTHOR]