Preprint Article Version 3 Preserved in Portico This version is not peer-reviewed

Formal Calculation

Version 1 : Received: 3 May 2023 / Approved: 5 May 2023 / Online: 5 May 2023 (06:23:10 CEST)
Version 2 : Received: 1 August 2023 / Approved: 1 August 2023 / Online: 2 August 2023 (10:11:58 CEST)
Version 3 : Received: 5 October 2023 / Approved: 5 October 2023 / Online: 7 October 2023 (03:26:10 CEST)

How to cite: Peng, J. Formal Calculation. Preprints 2023, 2023050311. https://doi.org/10.20944/preprints202305.0311.v3 Peng, J. Formal Calculation. Preprints 2023, 2023050311. https://doi.org/10.20944/preprints202305.0311.v3

Abstract

Formal Calculation uses an auxiliary form to calculate various nested sums and provides results in three forms. In addition to computation, it is also a powerful tool for analysis, allowing one to study various numbers in a unified way. This article contains many results of two types of Stirling numbers, associated Stirling numbers, and Eulerian numbers, making a great generalization of Euler polynomials, Wilson's theorem, and Wolstenholme's theorem, showing that they are just special cases. Formal Calculation provides a novel method for obtaining combinatorial identities and analyzing q-binomial.This article has obtained a large number of results in q-analogues, including inversion formulas for q-binomial coefficients. This article also introduces a theorem on symmetry.

Keywords

Formal Calculation; nested sums; Gaussian coefficient; Stirling number; associated Stirling numbers; Eulerian number and polynomial;Wolstenholme theorem

Subject

Computer Science and Mathematics, Discrete Mathematics and Combinatorics

Comments (1)

Comment 1
Received: 7 October 2023
Commenter: Ji Peng
Commenter's Conflict of Interests: Author
Comment: Add a large number of results in q-analogue, including inversion formulas of q-binomial 
+ Respond to this comment

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 1
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.