Results 141 to 150 of about 94,783 (262)

A Generalization of the Digital Binomial Theorem

open access: yes, 2015
We prove a generalization of the digital binomial theorem by constructing a one-parameter subgroup of generalized Sierpinski matrices. In addition, we derive new formulas for the coefficients of Prouhet-Thue-Morse polynomials and describe group relations satisfied by generating matrices defined in terms of these Sierpinski matrices.
openaire   +2 more sources

Fermat's Last and the Binomial Theorem

open access: yes
A factoring of the function (a+b-c)n to get a general solution for a,b,c in FLT. We use two cases: n even or odd and the Binomial theorem to solve,
openaire   +1 more source

Use of identity of A. Hurwitz for construction of a linear positive operator of approximation

open access: yesJournal of Numerical Analysis and Approximation Theory, 2002
By using a general algebraic identity of Adolf Hurwitz [1], which generalizes an important identity of Abel, we construct a new operator \(S_m^{(\beta_1,\ldots,\beta_m)}\) approximating the functions. A special case of this is the operator \(Q_m^\beta\)
Dimitrie D. Stancu
doaj  

Home - About - Disclaimer - Privacy