Some identities of Gaussian binomial coefficients

In this paper, we present some identities of Gaussian binomial coefficients with respect to recursive sequences, Fibonomial coefficients, and complete functions by use of their relationships.

Asymptotic approximation of central binomial coefficients with rigorous error bounds

We show that a well-known asymptotic series for the logarithm of the central binomial coefficient is strictly enveloping in the sense of Pólya and Szegö, so the error incurred in truncating the series is of the same sign as the next term, and is bounded in magnitude by that term. We consider closely related asymptotic series for Binet's function, for \(\ln\Gamma(z+\frac12)\), and for the Riemann-Siegel theta function, and make some historical remarks.

Binomial Number System

This paper presents and first scientifically substantiates the generalized theory of binomial number systems (BNS) and the method of their formation for reliable digital signal processing (DSP), transmission, and data storage. The method is obtained based on the general theory of positional number systems (PNS) with conditions and number functions for converting BNS with a binary alphabet, also allowing to generate matrix BNS, linear-cyclic, and multivalued number systems. Generated by BNS, binomial numbers possess the error detection property. A characteristic property of binomial numbers is the ability, on their basis, to form various combinatorial configurations based on the binomial coefficients, e.g., compositions or constant-weight (CW) codes. The theory of positional binary BNS construction and generation of binary binomial numbers are proposed. The basic properties and possible areas of application of BNS researched, particularly for the formation and numbering of combinatorial objects, are indicated. The CW binomial code is designed based on binary binomial numbers with variable code lengths. BNS is efficiently used to develop error detection digital devices and has the property of compressing information.

Hankel determinants of linear combinations of moments of orthogonal polynomials, II

We present a formula that expresses the Hankel determinants of a linear combination of length $$d+1$$ d + 1 of moments of orthogonal polynomials in terms of a $$d\times d$$ d × d determinant of the orthogonal polynomials. This formula exists somehow hidden in the folklore of the theory of orthogonal polynomials but deserves to be better known, and be presented correctly and with full proof. We present four fundamentally different proofs, one that uses classical formulae from the theory of orthogonal polynomials, one that uses a vanishing argument and is due to Elouafi (J Math Anal Appl 431:1253–1274, 2015) (but given in an incomplete form there), one that is inspired by random matrix theory and is due to Brézin and Hikami (Commun Math Phys 214:111–135, 2000), and one that uses (Dodgson) condensation. We give two applications of the formula. In the first application, we explain how to compute such Hankel determinants in a singular case. The second application concerns the linear recurrence of such Hankel determinants for a certain class of moments that covers numerous classical combinatorial sequences, including Catalan numbers, Motzkin numbers, central binomial coefficients, central trinomial coefficients, central Delannoy numbers, Schröder numbers, Riordan numbers, and Fine numbers.

Finite Sums Involving Reciprocals of the Binomial and Central Binomial Coefficients and Harmonic Numbers

We prove some finite sum identities involving reciprocals of the binomial and central binomial coefficients, as well as harmonic, Fibonacci and Lucas numbers, some of which recover previously known results, while the others are new.

METHODOLOGY OF THE TEACHING OF FINITE MATHEMATICS AT THE PEDAGOGICAL UNIVERSITIES DUE TO THE NEW TRENDS IN THE EVOLUTION OF THE MATHEMATICAL SCIENCES

There were introduced new methods of the teaching and instruction of the following parts of the Pre-calculus: (1) Binomial Series; (2) Trigonometry; (3) Partial Fractions. The problems introduced in the article for the Pre-Calculus Course in Finite Mathematics was developed by the author. These unabridged problems are developed within the new trends in the evolutions of the novelty of the syllabi in Mathematics due to the development of the Mathematics Sciences / Theory and Applications. These new trends in the Theory and Application of Mathematics Sciences have been added new demands to the newly revised textbooks and corresponding syllabi for the Mathematics Courses taught at the Junior two years Colleges and Pedagogical Universities.These newly developed problems are reflection of the Development of Mathematical and Engineering Sciences to offer great amount of learning conclusion/sequel to those who pursue a bachelor’s degree at the universities of the pedagogical orientation. The problems presented in the article here are developed and restructured in terms of the newly developed techniques to solve the problem in Finite Mathematics and Engineering sciences. Moreover, the techniques offered in the article here are more likely to get utilized in Advanced Engineering Sciences, too, within the content of the problems, which require to obtain finite numerical solutions to the Real Phenomena Natural Problems in Engineering Sciences and Applied Problems in Mathematical Physics.The aim of this present publication is to offer new advanced techniques and instructional strategies to discuss methodology and instructional strategies of the mathematical training of the students at the Pedagogical Universities. Moreover, these new teaching techniques and strategies introduced may be extended to the engineering sciences at the technical universities, too.The results and scientific novelty of the introduced methodology and learning conclusions and sequel of the new knowledge the students at the Pedagogical universities may be benefited from are in the following list of the learning conclusions, presented in the article here. The students of the pedagogical orientation may attain the mastery skills in the following sections of the combinatorics in Finite Mathematics subject:- The n! Combination of n different terms.- Evaluate the expressions with factorials.- Identify that there are -!!( )!nrnr various of combinations of r identical terms in n variations.- Identify and evaluate the combinatorial coefficients from the Binomial Theorem.- Identify and able to build the Pascal’s triangle of the binomial coefficients.- Utilize the Binomial Theorem to expand the binomial formula for any natural powers.- Utilize the Binomial Theorem to obtain the general formula for the n-th term of binomial expansion.- Utilize the Sigma Symbols in the Binomial Theorem for the n-th terms of the binomial expansion. 19- Generate the expansion for the power of the ex, where e is the base of natural logarithmic function y = f(x) = x.Practical significance: the methods of teaching and new teaching strategies offered here in the article alongside with the application of the new trends in the development of mathematical and mathematics education sciences can be useful for prospective and currently practicing teachers of mathematics. Moreover, the materials presented here in this article can be useful for the educational professionals in their professional development plans to improve the quality in education

Maclaurin's series expansions of real powers of inverse (hyperbolic) cosine and sine functions with applications

In the paper, by means of the Faa di Bruno formula, with the help of explicit formulas for special values of the Bell polynomials of the second kind with respect to a specific sequence, and by virtue of two combinatorial identities containing the Stirling numbers of the first kind, the author establishes Maclaurin's series expansions for real powers of the inverse cosine (sine) function and the inverse hyperbolic cosine (sine) function. By applying different series expansions for the square of the inverse cosine function, the author not only finds infinite series representations of the circular constant Pi and its square, but also derives two combinatorial identities involving central binomial coefficients.