1. Calculation Formula
q-binomial: , abbreviated as .
. .
is Kronecker delta,
. The following relationship holds:
Definition 1.
Recursively define , ; , , .
Definition 2. =Number of .
=Number of , =Number of .
=Number of , =Number of .
, . Use the auxiliary form and each cannot be swapped:
Theorem 1.
.
. Following a similar form, induction proves:
Theorem 2. , .
Definition 3. .
.
2. Property
Definition 4. similarly defining .
Theorem 3.
(1). .
(2). At , can swap orders.
(3). .
(4). . can great than 1.
(5). .
(6) At , .
Proof. Definition of , which has been used for the proof of [1].
At (4), , . (6) is . □
.
Theorem 4. ,
(1). .
(2). .
(3). .
(4). .
Definition 5.
Definition 6.
,
Theorem 5. .
In this article, .
.
We can choose such can take any value, can be converted to .
then , , . c is a constant. Similarly, for any PT, can be converted into constant . From [4], [3(3)]:
Theorem 6. .
If can be converted into , then
, .
The latter part refers to the necessary and sufficient conditions for merging, which correspond to .
. By utilizing this, we can extend . As long as the Y of is greater than , , then is also allowed. For Example:
.
.
. This way we can expand .
3. Application
Proposition 1.
(1). .
(2). .
(3). .
(4). .
(5). .
(6). .
(4) is unrelated to
N; it is an effect of
, just as the difference table of a polynomial series will have a row of constants.
Proposition 2.
(1). .
(2). . Generalized Rothe’s q-Binomial Theorem.
(3). .
Proposition 3.
(1). ; .
(2). .
(3). .
Another Gauss’s identity: [2] p.65. Inspired by the above form:
Proposition 4. . .
Proposition 5.
(1). .
(2). .
(3). .
(4). .
Definition 7. Set come from p Source: .
. .
Proposition 6. .
Definition 8. .
Easy to obtain: , .
Proposition 7.
.
Proposition 8.
(1). , .
(2). , .
(3). , .
Proposition 9. .
.
4. Extensions of q-Euler Polynomials and Relationships between Three Forms
In this section, .
Lemma 2.
Theorem 7. , ,
(1). ,define as .
(2). .
(3). .
(4). , .
, is q-Eularian polynomials[2] p.332. [7] → three expressions for .
Eularian polynomials: .
At [6], some relationships have been obtained, and now the remaining ones can be deduced:
Theorem 8.
(1). .
(2). , .
(3). If can be converted into , then
, .
(4). If can be converted into , then
, .
Theorem 9. ,
(1). .
(2). .
(3). .
5. Inferences of Relationships Among the Three Forms
Simplifying the mutual expressions yields the inversion formulas.
Theorem 10. Sum from 0 to M,
(1). .
(2).
(3). .
Arbitrariness of can derive the formulas of .
Theorem 11. Sum from 0 to M, ,
(1). .
(2). .
(3). .
Combining [6] and [8(3)(4)] , . That is to say:
Theorem 12. Sum from 0 to M,
(1). .
(2). .
(3). .
Theorem 13. Sum from 0 to M,
(1). , .
(2). , .
(3). , .
Theorem 14. .
Theorem 15. Sum from 0 to M, ,
(1). , .
(2). , .
(3). , .
(4). .
(5). .
(6). .
(1) or (4) (4.1*).